Open Access
April 2009 Capacitive flows on a 2D random net
Olivier Garet
Ann. Appl. Probab. 19(2): 641-660 (April 2009). DOI: 10.1214/08-AAP556

Abstract

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.

Citation

Download Citation

Olivier Garet. "Capacitive flows on a 2D random net." Ann. Appl. Probab. 19 (2) 641 - 660, April 2009. https://doi.org/10.1214/08-AAP556

Information

Published: April 2009
First available in Project Euclid: 7 May 2009

zbMATH: 1166.60337
MathSciNet: MR2521883
Digital Object Identifier: 10.1214/08-AAP556

Subjects:
Primary: 60K35
Secondary: 82B43

Keywords: First-passage percolation , maximal flows

Rights: Copyright © 2009 Institute of Mathematical Statistics

Vol.19 • No. 2 • April 2009
Back to Top