Résumé : We consider the model of first passage percolation on Zd in dimension d≥2 : we associate with the edges of the graph a family of i.i.d. non negative random variables. We interpret the random variable associated with an edge as its capacity, i.e., the maximal amount of water or information that can cross the edge per second. This leads to a natural definition of maximal flow through a bounded domain of the graph from a collection of sources to a collection of sinks. This maximal flow is equal to the minimal capacity of a cutset, i.e., a set of edges such that if we remove it from the graph we disconnect completely the sources from the sinks. In this talk, we will focus on one of the properties of this minimal cutset : it's cardinality. This is a joint work with Barbara Dembin (LPSM, Université de Paris).
Dernière modification : Friday 18 October 2019 | Contact : Cyril.Banderier at lipn.univ-paris13.fr |