Dying percolation conjecture
The dying percolation conjecture[1] (also known as conjecture) is a prominent conjecture in percolation theory[2]. It states that critical Bernoulli bond percolation on for almost surely has no infinite clusters.
The conjecture is proved for the cases by Kesten[3], for [4] by Hara and Slade using the technique called "lace expansion". The later result was then improved to [5] by Fitzner and van der Hofstad.
The conjecture is sometimes called the "Dying percolation conjecture", a name used by mathematician Gil Kalai[6][7][8][9]. The name evokes the intuition that the cluster at origin "just barely" fails to survive at the critical threshold.
Background
In nearest-neighbor Bernoulli bond percolation on , each edge of the integer lattice is independently declared open with probability and closed otherwise. A cluster is a maximal connected subgraph of open edges. The central question of percolation theory is: for which values of does an infinite cluster exist almost surely.
The percolation probability is defined as the probability that the cluster containing is infinite. By a coupling argument, one can show that is a non-decreasing function of . As a corollary, for any dimension there exists a critical probability (denoted by ) , such that
- For , every cluster is almost surely finite.
- For , an infinite cluster almost surely exists.
The conjecture asks whether , i.e. whether is continuous or has a discontinuity at .
Equivalent formulations
The following statements are equivalent for Bernoulli percolation on :
- Bernoulli bond percolation with critical parameter has no infinite cluster almost surely;
- No infinite cluster at criticality at the origin: ;
- Continuity of at ;
- Continuity of .
The last formulation is equivalent to the others, since Aizenman, Kesten and Newman showed[10] that is continuous at all points of except for possibly .
Significance
The conjecture is among the central open problems in percolation theory [11]. (Benjamini Lyons)[12] open their paper by describing it as "the main long-standing open question in percolation theory". Fields medalist Hugo Duminil-Copin in his ICM lecture "Sixty years of percolation" frames the development of percolation theory around this conjecture[2]. Louigi Addario-Berry[8] suggested that it's among the most important problems in the larger field of probability theory.
This conjecture needs to be true for most percolation critical exponents to be well-defined[13]. As such, it is predicted by physicists studying phase transition theory. The most relevant physically case () remains open.
Known results
d=1
For , the critical probability and So the conjecture is false. However, for , ..[14], and the conjecture is widely believed to be true.
d=2
The dimension is the only dimension (besides 1) where is known exactly. For the other dimensions, there are only numerical approximations. It was proven to be by Kesten[3] after years of being the problem that drove most of the efforts in the field[2]. This resolved the conjecture for , since was already proven by Harris[15].
For 2-dimensional lattices, continuity of the phase transition is proved only for some lattices other than square lattice. It is conjectured for them to belong to the same universality class and so to have the same critical behavior.
High dimensions ()
For larger , the conjecture is listed as Problem 5 in Section 12 of (Kesten 1982)[11]. Since then, the partial cases and generalizations of the conjecture received much attention[2]
In 1990, Hara and Slade[4] used the lace expansion technique to show that percolation at the critical parameter exhibits a mean-field behavior. Namely, they showed that quantities such as obey the power laws, with exponents predicted by the mean-field theory. Later, their techniques were improved to lower the dimension down to 11[5]. However, the mean-field behavior cannot hold in dimensions 5 and less, so dimensions 3, 4 and 5 cannot be covered by an extension of this proof. For dimensions higher than 6, the conjecture is true for a "spread out" percolation, where additional edges are added to any pair of vertices on distance less than a large enough parameter [4]
Percolation on half-space
It is shown in (Barsky Grimmett)[16] that for any , the critical bond percolation restricted to a half-space almost surely doesn't contain an infinite cluster. This is in contrast with the result of (Grimmett Marstrand)[17] that for any , the percolation on a slab almost surely has an infinite cluster for large enough .
Nonamenable and exponential-growth graphs
The conjecture has been verified for a large class of transitive graphs whose growth is faster than any polynomial.
The foundational result in this direction is due to (Benjamini Lyons)[12]: critical Bernoulli percolation on any Cayley graph of a nonamenable group has no infinite clusters. As a trivial partial case, it covers infinite -regular trees.
In (Hutchcroft 2016)[18], this result was extended to all quasi-transitive graphs of exponential growth.
Reduction to a conjectural correlation inequality
In (Kozma Nitzan)[19], the authors reduced the conjecture to various correlation inequalities decreasing in strength. They are supported by numerical evidence, and if true, any of them will resolve the conjecture.
References
- ↑ "Analysis of Boolean Functions week 5 and 6". 7 October 2013. https://gilkalai.wordpress.com/2013/10/07/analysis-of-boolean-functions-week-5-and-6/.
- ↑ 2.0 2.1 2.2 2.3 Duminil-Copin, Hugo (2017-12-13). "Sixty years of percolation". arXiv:1712.04651 [math.PR].
- ↑ 3.0 3.1 Kesten, Harry (February 1980). "The critical probability of bond percolation on the square lattice equals 1/2" (in en). Communications in Mathematical Physics 74 (1): 41–59. doi:10.1007/BF01197577. ISSN 1432-0916. Bibcode: 1980CMaPh..74...41K. https://link.springer.com/article/10.1007/BF01197577.
- ↑ 4.0 4.1 4.2 Hara, Takashi; Slade, Gordon (March 1990). "Mean-field critical behaviour for percolation in high dimensions" (in en). Communications in Mathematical Physics 128 (2): 333–391. doi:10.1007/BF02108785. ISSN 1432-0916. Bibcode: 1990CMaPh.128..333H. https://link.springer.com/article/10.1007/BF02108785.
- ↑ 5.0 5.1 Fitzner, Robert; van der Hofstad, Remco (1 January 2017). "Mean-field behavior for nearest-neighbor percolation in d > 10". Electronic Journal of Probability 22 (none). doi:10.1214/17-EJP56.
- ↑ "Analysis of Boolean Functions week 5 and 6". 7 October 2013. https://gilkalai.wordpress.com/2013/10/07/analysis-of-boolean-functions-week-5-and-6/.
- ↑ Eca (2021). "Interview with Gil Kalai". Enumerative Combinatorics and Applications 2 (2): Interview #S3I7. doi:10.54550/ECA2022V2S2I7.
- ↑ 8.0 8.1 "What are the big problems in probability theory?". https://mathoverflow.net/questions/37151/what-are-the-big-problems-in-probability-theory.
- ↑ "Updates and Plans IV". 20 March 2024. https://gilkalai.wordpress.com/2024/03/20/updates-and-plans-iv/.
- ↑ Aizenman, M.; Kesten, H.; Newman, C. M. (December 1987). "Uniqueness of the infinite cluster and continuity of connectivity functions for short and long range percolation" (in en). Communications in Mathematical Physics 111 (4): 505–531. doi:10.1007/BF01219071. ISSN 1432-0916. Bibcode: 1987CMaPh.111..505A. https://link.springer.com/article/10.1007/BF01219071.
- ↑ 11.0 11.1 Kesten, Harry (1982). Percolation Theory for Mathematicians. doi:10.1007/978-1-4899-2730-9. ISBN 978-0-8176-3107-9. https://link.springer.com/book/10.1007/978-1-4899-2730-9.
- ↑ 12.0 12.1 Benjamini, Itai; Lyons, Russell; Peres, Yuval; Schramm, Oded (July 1999). "Critical Percolation on Any Nonamenable Group has no Infinite Clusters". The Annals of Probability 27 (3). doi:10.1214/aop/1022677450.
- ↑ The Princeton companion to mathematics. Princeton: Princeton University Press. 2008. pp. 663. ISBN 9780691118802.
- ↑ Hugo Duminil-Copin (November 2, 2022). "Introduction to Bernoulli percolation". https://www.unige.ch/~duminil/publi/2017percolation.pdf.
- ↑ Harris, T. E. (January 1960). "A lower bound for the critical probability in a certain percolation process" (in en). Mathematical Proceedings of the Cambridge Philosophical Society 56 (1): 13–20. doi:10.1017/S0305004100034241. ISSN 1469-8064. Bibcode: 1960PCPS...56...13H. https://www.cambridge.org/core/journals/mathematical-proceedings-of-the-cambridge-philosophical-society/article/lower-bound-for-the-critical-probability-in-a-certain-percolation-process/E219E996BB4B19341B06E90E285B31D3.
- ↑ Barsky, David J.; Grimmett, Geoffrey R.; Newman, Charles M. (March 1991). "Percolation in half-spaces: equality of critical densities and continuity of the percolation probability" (in en). Probability Theory and Related Fields 90 (1): 111–148. doi:10.1007/BF01321136. ISSN 1432-2064. https://link.springer.com/article/10.1007/BF01321136.
- ↑ Grimmett, G. R.; Marstrand, J. M. (1990). "The Supercritical Phase of Percolation is Well Behaved". Proceedings: Mathematical and Physical Sciences 430 (1879): 439–457. doi:10.1098/rspa.1990.0100. ISSN 0962-8444. Bibcode: 1990RSPSA.430..439G. https://www.jstor.org/stable/80004?seq=2.
- ↑ Hutchcroft, Tom (September 2016). "Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters". Comptes Rendus Mathematique 354 (9): 944–947. doi:10.1016/j.crma.2016.07.013. ISSN 1631-073X. Bibcode: 2016CRMat.354..944H. https://www.sciencedirect.com/science/article/pii/S1631073X16301352.
- ↑ Template:Cite Arxiv
