Higher-dimensional max-flow min-cut law for random networks
Higher-dimensional max-flow min-cut law for random networks
Let and let be the common distribution of the independent edge capacities on the lattice . Write for the bond-percolation threshold, let denote the reduced boundary of a convex set , let be its exterior measure-theoretic unit normal, and let be -dimensional Hausdorff measure. Assume
and, for some ,
Higher-dimensional max-flow min-cut conjecture. There exists a map on the unit sphere such that, for every convex set with in its interior,
The conjecture proposes that the normalized minimum capacity separating a dilated convex set from infinity has a deterministic anisotropic surface-energy limit in higher dimensions, extending the two-dimensional results discussed in the paper. The supplied text gives no resolution status or further conditions beyond those stated above.
Sources & referencesView supporting material
Primary source
Olivier Garet, “Capacitive flows on a 2D random net”, arXiv:math/0608676 (2009).
Progress summary
The conjectured law is now a theorem in every dimension covered by the problem’s assumptions.
Garet proposed the higher-dimensional extension in 2009; the two-dimensional case was already known. The assertion identifies a deterministic limiting surface energy for the minimum capacity separating a large convex region from infinity.
Known results
- Dimension : the law was proved by Garet (year not specified in the retrieved source).
2018–2019 higher-dimensional proof
A paper proves the conjecture for under the percolation and exponential-moment hypotheses, with convergence of to the stated anisotropic boundary integral. It also gives an exponential deviation estimate and establishes existence of a minimal cutset. The result appeared as a 2018 preprint and was published in 2019.
Current status (as of August 2026): the law is settled for and under the stated hypotheses, so no case in the stated range remains open.
Sources
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.