Submitted:
20 September 2024
Posted:
20 September 2024
You are already at the latest version
Abstract
Keywords:
1. Introduction
2. Methodology and Problem Statement
2.1. Assumptions
- The system has a well-defined critical probability , which separates subcritical (nonpercolating) from supercritical (percolating) regimes [Kesten, 1982].
- represents the probability of a percolating cluster forming inside the ball .
- The probability space is properly defined for the percolation model, and all relevant events are measurable.
- The system is supercritical, meaning , where is the probability of the infinite cluster in the infinite lattice [Grimmett, 1999].
3. Preliminary Lemmas
4. Main Proof
- There exists an infinite cluster with positive probability [Grimmett, 1999].
- The probability of an infinite cluster is less than 1 for .
- There exists an infinite cluster with positive probability [Grimmett, 1999].
- The probability of an infinite cluster is less than 1 for .
- for all , as each ball has at least the probability of containing a point from the infinite cluster.
- for all finite , as there is always a positive probability of no percolation in a finite region.
- Consider two sequences and with .
- For any , there exists such that for all and both contain any fixed finite subset of the lattice with probability .
- This implies that for all .
- As is arbitrary, the limits must coincide.
3. Discussion
4. Conclusions
Conflicts of Interest
References
- Albert, R.; Barabási, A.-L. Statistical mechanics of complex networks. Reviews of Modern Physics 2002, 74, 47. [Google Scholar] [CrossRef]
- Billingsley, P. Probability and Measure, 3rd ed.; Wiley, 1995. [Google Scholar]
- Bollobás, B.; Riordan, O. Percolation; Cambridge University Press, 2006. [Google Scholar]
- Broadbent, S.R.; Hammersley, J.M. Percolation processes: I. Crystals and mazes. Mathematical Proceedings of the Cambridge Philosophical Society 1957, 53, 629–641. [Google Scholar] [CrossRef]
- Durrett, R. Probability: Theory and Examples, 4th ed.; Cambridge University Press, 2010. [Google Scholar]
- Grimmett, G. Percolation, 2nd ed; Springer, 1999. [Google Scholar]
- Kesten, H. Percolation Theory for Mathematicians; Birkhäuser, 1982. [Google Scholar]
- Newman, M.E.J. Networks: An Introduction; Oxford University Press, 2010. [Google Scholar]
- Royden, H.L.; Fitzpatrick, P. Real Analysis, 4th ed.; Pearson, 2010. [Google Scholar]
- Rudin, W. Real and Complex Analysis, 3rd ed.; McGraw-Hill, 1987. [Google Scholar]
- Stauffer, D.; Aharony, A. Introduction to Percolation Theory, 2nd ed.; Taylor & Francis, 1994. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).