Galton–Watson Trees with Vanishing Martingale Limit
We show that an infinite Galton–Watson tree, conditioned on its martingale limit being smaller than \(\varepsilon \), agrees up to generation \(K\) with a regular \(\mu \)-ary tree, where \(\mu \) is the essential minimum of the offspring distribution and the random variable \(K\) is strongly concentrated near an explicit deterministic function growing like a multiple of \(\log (1/\varepsilon )\). More precisely, we show that if \(\mu \ge 2\) then with high probability, as \(\varepsilon \downarrow 0\), \(K\) takes exactly one or two values. This shows in particular that the conditioned trees converge to the regular \(\mu \)-ary tree, providing an example of entropic repulsion where the limit has vanishing entropy. Our proofs are based on recent results on the left tail behaviour of the martingale limit obtained by Fleischmann and Wachtel .
KeywordsConditioning principle Large deviations Micro-canonical distribution Sharp thresholds Branching Entropic repulsion
Mathematics Subject Classification (2000)60J80 (Primary) 60F10 60K37
- 7.Dembo, A., Zeitouni, O.; Large deviations techniques and applications. Applications of Mathematics 38, 2nd edn. Springer, New York, 1998Google Scholar
- 12.Lyons, R. with Peres, Y. (2014). Probability on Trees and Networks. Cambridge University Press. In preparation. http://mypage.iu.edu/~rdlyons/
- 14.Meda, A., Ney, P.; The Gibbs conditioning principle for Markov chains. In: Perplexing problems in probability, pp. 385–398. Progr. Probab., 44. Birkhäuser, Boston (1999)Google Scholar
- 17.Stroock, D. W., Zeitouni, O.; Microcanonical distributions, Gibbs states, and the equivalence of ensembles. In: Random walks, Brownian motion, and interacting particle systems, pp. 399–424. Progr. Probab., 28. Birkhäuser, Boston (1991)Google Scholar