Capacitive flows on a 2D random net
Probability
2009-05-14 v3
Abstract
This paper concerns maximal flows on traveling from a convex set to infinity, the flows being restricted by a random capacity. For every compact convex set , we prove that the maximal flow between and infinity is such that almost surely converges to the integral of a deterministic function over the boundary of . 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.
Keywords
Cite
@article{arxiv.math/0608676,
title = {Capacitive flows on a 2D random net},
author = {Olivier Garet},
journal= {arXiv preprint arXiv:math/0608676},
year = {2009}
}
Comments
20 pages, 1 figure published in The Annals of Applied Probability http://www.imstat.org/aap/