# Limit theorems for maximum flows on a lattice

Article

## Abstract

We independently assign a non-negative value, as a capacity for the quantity of flows per unit time, with a distribution F to each edge on the $$\mathbf{Z}^d$$ lattice. We consider the maximum flows through the edges from a source to a sink in a large cube. In this paper, we show that the ratio of the maximum flow and the size of the source is asymptotic to a constant. This constant is denoted by the flow constant. By the max-flow and min-cut theorem, this is equivalent to a statement about the asymptotic behavior of the minimal value assigned to any surface on the large cube. We can also show that there exists such a surface that is proportional to the size of the faces of the cube.

### Keywords

Maximum flow and minimum cut Random surfaces Cluster boundary First passage percolation

60K 35

## Notes

### Acknowledgements

The author is grateful to the referee who read the paper carefully, and presented a long report with many detailed and valuable comments and suggestions to improve the exposition. The author would also like to thank Cerf and Theret for their encouragement and many suggestions.

### References

1. 1.
Aizenman, M., Chayes, J.T., Chayes, L., Frohlich, J., Russo, L.: On a sharp transition from area law to perimeter law in a system of random surfaces. Commun. Math. Phys. 92, 19–69 (1983)
2. 2.
Cerf, R., Theret, M.: Lower large deviations for the maximal flow through a domain of $$R^d$$ in first passage percolation. Probab. Theory Relat. Fields 150, 635–661 (2011)
3. 3.
Chayes, L., Chayes, J.: Bulk transport properties and exponent inequalities for random resistor and flow networks. Commun. Math. Phys. 105, 133–152 (1986)
4. 4.
Engle, E.: Sperner Theory. Cambridge University Press, Cambridge (1997)
5. 5.
Grimmett, G.: Percolation. Springer, Berlin (1999)
6. 6.
Grimmett, G., Kesten, H.: First-passage percolation, network flows, and electrical resistances. Z. Wahrsch. Verw. Gebiete. 66, 335–366 (1984)
7. 7.
Gold, J.: Isoperimetry in supercritical bond percolation in dimensions three and higher. arXiv:1602.05598 (2016)
8. 8.
Hammersley, J.M., Welsh, D.J.A.: First-passage percolation, subadditive processes, stochastic networks and generalized renewal theory. In: Neyman, J., LeCam, L. (eds.) Bernoulli, Bayse, Laplace Anniversary Volume, pp. 61–110. Springer, Berlin (1965)Google Scholar
9. 9.
Kesten, H.: Percolation Theory for Mathematicians. Birkhauser, Berlin (1982)
10. 10.
Kesten, H.: Aspects of First-Passage Percolation. Lecture Notes in Mathematics, pp. 126–264. Springer, Berlin (1986)Google Scholar
11. 11.
Kesten, H.: Surfaces with minimal random weights and maximal flows: a higher-dimensional version of first-passage percolation. Ill. J. Math. 31, 99–166 (1987)
12. 12.
Kesten, H.: On the speed of convergence in first passage percolation. Ann. Appl. Probab. 3, 296–338 (1993)
13. 13.
Kesten, H., Zhang, Y.: The probability of a large finite cluster in supercritical Bernoulli percolation. Ann. Probab. 18, 537–555 (1990)
14. 14.
Rossignol, R., Theret, M.: Lower large deviations and laws of large numbers for maximal flows through a box in first passage percolation. Ann. Inst. Henri Poincare Probab. Stat. 46, 1093–1131 (2010)
15. 15.
Talagrand, M.: Concentration of measure and isoperimetric inequalities in product spaces. Inst. Hautes Publ. Math. Etudes Sci. 81, 73–205 (1995)
16. 16.
Zhang, Y.: Critical behavior for maximal flows on the cubic lattice. J. Stat. Phys. 98, 799–811 (2000)
17. 17.
Zhang, Y.: Limit theorems for maximum flows on a lattice. arXiv:0710.4589 (2007)
18. 18.
Zhang, Y.: Shape fluctuations are different in different directions. Ann. Probab. 36, 331–362 (2008)