Access the full text.
Sign up today, get DeepDyve free for 14 days.
B. Pittel, J. Spencer, N. Wormald (1996)
Sudden Emergence of a Giantk-Core in a Random GraphJ. Comb. Theory, Ser. B, 67
W. Rudin (1964)
Principles of mathematical analysis
Jesus Encinas, Pedro Harunari, Marcelo Oliveira, C. Fiore (2018)
Fundamental ingredients for discontinuous phase transitions in the inertial majority vote modelScientific Reports, 8
H. Duminil-Copin (2018)
Sharp threshold phenomena in statistical physicsJapanese Journal of Mathematics, 14
Moumanti Podder, J. Spencer (2015)
Galton-Watson Probability ContractionarXiv: Probability
R. Fitzner, R. Hofstad (2015)
Mean-field behavior for nearest-neighbor percolation in $d>10$Electronic Journal of Probability, 22
B. Bollobás (2015)
The Probabilistic MethodFundamentals of Ramsey Theory
B. Bollobás, O. Riordan (2004)
A Short Proof of the Harris–Kesten TheoremBulletin of the London Mathematical Society, 38
T. Hara, G. Slade (1990)
Mean-field critical behaviour for percolation in high dimensionsCommunications in Mathematical Physics, 128
Antonio Auffinger, Dylan Cable (2017)
Pemantle's min-plus binary treearXiv: Probability
J. Spencer, Moumanti Podder (2015)
First Order Probabilities For Galton-Watson TreesarXiv: Probability
E. Friedgut, G. Kalai (1996)
Every monotone graph property has a sharp threshold, 124
C. Garban, J. Steif (2011)
Noise Sensitivity of Boolean Functions and Percolation
a) Suppose that χ can be perturbed so that a fixed point of Ψ χ emerges from 0
T. Luczak, J. Spencer (1991)
When does the zero-one law hold?Journal of the American Mathematical Society, 4
E. Friedgut, appendix Bourgain (1999)
Sharp thresholds of graph properties, and the -sat problemJournal of the American Mathematical Society, 12
A. Holroyd, James Martin (2019)
Galton–Watson gamesRandom Structures & Algorithms, 59
S. Boccaletti, J. Almendral, S. Guan, Inmaculada Leyva, Z. Liu, I. Sendiña-Nadal, Z. Wang, Y. Zou (2016)
Explosive transitions in complex networks’ structure and dynamics: Percolation and synchronizationPhysics Reports, 660
O. Riordan (2005)
The k-Core and Branching ProcessesCombinatorics, Probability and Computing, 17
Can we characterize the critical child measures χ in a more direct way than stating properties of Ψ χ ?
F. Dekking (1991)
Branching processes that grow faster than binary splittingAmerican Mathematical Monthly, 98
Cambridge Press (2021)
Cambridge University Press
Tobias Johnson, Moumanti Podder, Fiona Skerman (2018)
Random tree recursions: Which fixed points correspond to tangible sets of trees?Random Structures & Algorithms, 56
S. Shelah, J. Spencer (1988)
Zero-one laws for sparse random graphsJournal of the American Mathematical Society, 1
Abstract Distinguishing between continuous and first-order phase transitions is a major challenge in random discrete systems. We study the topic for events with recursive structure on Galton–Watson trees. For example, let $\mathcal{T}_1$ be the event that a Galton–Watson tree is infinite and let $\mathcal{T}_2$ be the event that it contains an infinite binary tree starting from its root. These events satisfy similar recursive properties: $\mathcal{T}_1$ holds if and only if $\mathcal{T}_1$ holds for at least one of the trees initiated by children of the root, and $\mathcal{T}_2$ holds if and only if $\mathcal{T}_2$ holds for at least two of these trees. The probability of $\mathcal{T}_1$ has a continuous phase transition, increasing from 0 when the mean of the child distribution increases above 1. On the other hand, the probability of $\mathcal{T}_2$ has a first-order phase transition, jumping discontinuously to a non-zero value at criticality. Given the recursive property satisfied by the event, we describe the critical child distributions where a continuous phase transition takes place. In many cases, we also characterise the event undergoing the phase transition.
Combinatorics Probability Computing – Cambridge University Press
Published: Mar 1, 2022
Keywords: Galton–Watson tree; phase transition; first-order; 60J80; 60K35; 82B26
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.