Capacitive flows on a 2D random net
Olivier Garet
Abstract
This paper concerns maximal flows on Z2 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.
Create a lesson
Related papers
A Khintchine type inequality for non-independent random variables
Jingyu Huang, Wenxuan Tao
Uniform-in-Time and Uniform-in-Temperature Particle Approximations of Coulomb MMD Flows
Junho Lee, Promit Ghosal
A clarification of Fermi's formula for the maximum of partial sums
Alessandro Lodi
Uniform-in-time propagation of chaos for singular Lk interaction kernels with rates
Nicoleta Cazacu, Alexandre Richard, Milica Tomasevic
Sharp Rogers--Shephard Inequalities for Rényi Entropy
Bang-Xian Han, Guoqing Zhan, Chiyu Zhou et al.
Maximum degree for random geometric graphs in the connectivity regime and beyond
Junpei Otsuka