Capacitive flows on a 2D random net
Garet, Olivier
Ann. Appl. Probab., Tome 19 (2009) no. 1, p. 641-660 / Harvested from Project Euclid
This paper concerns maximal flows on ℤ2 traveling from a convex set to infinity, the flows being restricted by a random capacity. For every compact convex set A, we prove that the maximal flow Φ(nA) between nA and infinity is such that Φ(nA)/n almost surely converges to the integral of a deterministic function over the boundary of A. The limit can also be interpreted as the optimum of a deterministic continuous max-flow problem. We derive some properties of the infinite cluster in supercritical Bernoulli percolation.
Publié le : 2009-04-15
Classification:  First-passage percolation,  maximal flows,  60K35,  82B43
@article{1241702245,
     author = {Garet, Olivier},
     title = {Capacitive flows on a 2D random net},
     journal = {Ann. Appl. Probab.},
     volume = {19},
     number = {1},
     year = {2009},
     pages = { 641-660},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1241702245}
}
Garet, Olivier. Capacitive flows on a 2D random net. Ann. Appl. Probab., Tome 19 (2009) no. 1, pp.  641-660. http://gdmltest.u-ga.fr/item/1241702245/