Abstract
We show that the local limit of the uniform spanning tree on any finite, simple, connected, regular graph sequence with degree tending to \(\infty \) is the Poisson(1) branching process conditioned to survive forever. An extension to “almost” regular graphs and a quenched version are also given.
This is a preview of subscription content, access via your institution.
References
Aldous, D., Lyons, R.: Processes on unimodular random networks. Electron. J. Probab. 12(54), 1454–1508 (2007)
Alon, N., Nachmias, A., Shalev, M.: The diameter of the uniform spanning tree of dense graphs (2020). https://arxiv.org/abs/2009.09656
Benjamini, I., Schramm, O.: Recurrence of distributional limits of finite planar graphs. Electron. J. Probab. 6(23), 1–13 (2001)
Chandra, A.K., Raghavan, P., Ruzzo, W.L., Smolensky, R., Tiwari, P.: The electrical resistance of a graph captures its commute and cover times. Comput. Complex. 6(4), 312–340 (1996/97)
Foster, R.M.: The average impedance of an electrical network. In: Reissner Anniversary Volume. Contributions to Applied Mechanics, pp. 333–340. J. W. Edwards, Ann Arbor, Michigan (1948)
Grimmett, G.R.: Random labelled trees and their branching networks. J. Austral. Math. Soc. Ser. A 30(2), 229–237 (1980/81)
Hladký, J., Nachmias, A., Tran, T.: The local limit of the uniform spanning tree on dense graphs. J. Stat. Phys. 173(3–4), 502–545 (2018)
Kirchhoff, G.: Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird. Ann. Phys. Chem. 148(12), 497–508 (1847). https://doi.org/10.1002/andp.18471481202
Levin, D., Peres, Y., With contributions by E. Wilmer: Markov Chains and Mixing Times. American Mathematical Society (2017). http://darkwing.uoregon.edu/ dlevin/MARKOV/mcmt2e.pdf
Lyons, R., Pemantle, R., Peres, Y.: Conceptual proofs of \(L\log L\) criteria for mean behavior of branching processes. Ann. Probab. 23(3), 1125–1138 (1995)
Lyons, R., Peres, Y.: Probability on Trees and Networks. Cambridge Series in Statistical and Probabilistic Mathematics, vol. 42. Cambridge University Press, New York (2016)
Michaeli, P., Nachmias, A., Shalev, M.: The diameter of uniform spanning trees in high dimensions. Probab. Theory Relat. Fields 179(1–2), 261–294 (2021)
Nachmias, A.: Planar Maps, Random Walks and Circle Packing. École d’été de probabilités de Saint-Flour XLVIII—2018. Lecture Notes in Mathematics. École d’Été de Probabilités de Saint-Flour. [Saint-Flour Probability Summer School], vol. 2243. Springer, Cham (2020). ISBN: 978-3-030-27967-7; 978-3-030-27968-4
Nash-Williams, C.S.J.A.: Random walk and electric currents in networks. Proc. Camb. Philos. Soc. 55, 181–194 (1959)
Stewart, G.W.: On the continuity of the generalized inverse. SIAM J. Appl. Math. 17, 33–45 (1969)
Acknowledgements
This research is supported by ERC starting Grant 676970 RANDGEOM and by ISF Grants 1207/15 and 1294/19. Research of Y.P. was partially supported by NSF grant DMS-1900008. We wish to thank Jan Hladký for many useful conversations and for his permission to include his proof of Proposition 7.1. We also thank Matan Shalev for finding several errors in a previous version of this manuscript.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Nachmias, A., Peres, Y. The local limit of uniform spanning trees. Probab. Theory Relat. Fields 182, 1133–1161 (2022). https://doi.org/10.1007/s00440-021-01072-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00440-021-01072-2
Mathematics Subject Classification
- 05C81