The local limit of uniform spanning trees

DOI10.1007/s00440-021-01072-2zbMath1486.05285arXiv2011.08833OpenAlexW3173602762MaRDI QIDQ2128107

Asaf Nachmias, Yuval Peres

Publication date: 21 April 2022

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.08833

zbMATH Keywords

almost regular graphsPoisson(1) branching process

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Random walks on graphs (05C81)

Related Items (1)

The local weak limit of 𝑘-dimensional hypertrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The electrical resistance of a graph captures its commute and cover times
• The local limit of the uniform spanning tree on dense graphs
• Recurrence of distributional limits of finite planar graphs
• Conceptual proofs of \(L\log L\) criteria for mean behavior of branching processes
• Processes on unimodular random networks
• The diameter of uniform spanning trees in high dimensions
• Probability on Trees and Networks
• Planar Maps, Random Walks and Circle Packing
• On the Continuity of the Generalized Inverse

This page was built for publication: The local limit of uniform spanning trees