The local limit of the uniform spanning tree on dense graphs
From MaRDI portal
Publication:1633961
DOI10.1007/s10955-017-1933-5zbMath1404.05194arXiv1711.09788OpenAlexW3102136428MaRDI QIDQ1633961
Publication date: 21 December 2018
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.09788
Random graphs (graph-theoretic aspects) (05C80) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items (4)
The local limit of uniform spanning trees ⋮ Loop-erased partitioning of a graph: mean-field analysis ⋮ The local weak limit of 𝑘-dimensional hypertrees ⋮ Graphon convergence of random cographs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Limits of dense graph sequences
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Branching processes, random trees, and a generalized scheme of arrangements of particles
- On the number of perfect matchings and Hamilton cycles in \(\varepsilon\)-regular non-bipartite graphs
- Recurrence of distributional limits of finite planar graphs
- Percolation on dense graph sequences
- Processes on unimodular random networks
- Probability on Trees and Networks
- Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
- The number of spanning trees in regular graphs
- The number of spanning trees in graphs with a given degree sequence
- The phase transition in inhomogeneous random graphs
- Asymptotic Enumeration of Spanning Trees
This page was built for publication: The local limit of the uniform spanning tree on dense graphs
