The local limit of uniform spanning trees

DOI10.1007/S00440-021-01072-2MaRDI QIDQ2128107zbMATH OpenOpenAlexFDO

Authors Asaf Nachmias, Yuval Peres

Publication date 21 April 2022

Published in Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (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) Random walks on graphs (05C81) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Abstract: We show that the local limit of the uniform spanning tree on any finite, simple, connected, regular graph sequence with degree tending to infinity is the Poisson(1) branching process conditioned to survive forever. An extension to "almost" regular graphs and a quenched version are also given.

Recommendations

• The local limit of the uniform spanning tree on dense graphs
• scientific article; zbMATH DE number 1195780
• scientific article; zbMATH DE number 953290
• Uniform spanning trees on Sierpiński graphs
• Subsequential scaling limits of simple random walk on the two-dimensional uniform spanning tree

Cites work

• Conceptual proofs of L L criteria for mean behavior of branching processes
• scientific article; zbMATH DE number 3163289 (Why is no real title available?)
• scientific article; zbMATH DE number 3711987 (Why is no real title available?)
• scientific article; zbMATH DE number 3061533 (Why is no real title available?)
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• On the Continuity of the Generalized Inverse
• Planar maps, random walks and circle packing. École d'Été de Probabilités de Saint-Flour XLVIII -- 2018
• Probability on trees and networks
• Processes on unimodular random networks
• Recurrence of distributional limits of finite planar graphs
• The diameter of uniform spanning trees in high dimensions
• The electrical resistance of a graph captures its commute and cover times
• The local limit of the uniform spanning tree on dense graphs

Cited in

(16)

• The local limit of the uniform spanning tree on dense graphs
• The wired arboreal gas on regular trees
• Long-range properties of spanning trees
• And/or trees: A local limit point of view
• The local weak limit of \(k\)-dimensional hypertrees
• Forests on wired regular trees
• Subsequential scaling limits of simple random walk on the two-dimensional uniform spanning tree
• Uniform spanning trees on Sierpiński graphs
• Semi-Infinite Paths of the Two-Dimensional Radial Spanning Tree
• A local injective proof of log-concavity for increasing spanning forests
• The GHP scaling limit of uniform spanning trees in high dimensions
• Greedy maximal independent sets via local limits
• The wired minimal spanning forest on the Poisson-weighted infinite tree
• The GHP scaling limit of uniform spanning trees of dense graphs
• Massive spanning forests on the complete graph: exact distribution and local limit
• Local limit of the random degree constrained process

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128107)