Capacitive flows on a 2D random net

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…