Uniform spanning forests of planar graphs

DOI10.1017/FMS.2019.14MaRDI QIDQ5194701zbMATH OpenOpenAlexFDO

Authors Tom Hutchcroft, Asaf Nachmias

Publication date 17 September 2019

Published in Forum of Mathematics, Sigma (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

critical exponentsfree uniform spanning forest

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Geometric probability and stochastic geometry (60D05)

Abstract: We prove that the free uniform spanning forest of any bounded degree proper plane graph is connected almost surely, answering a question of Benjamini, Lyons, Peres and Schramm. We provide a quantitative form of this result, calculating the critical exponents governing the geometry of the uniform spanning forests of transient proper plane graphs with bounded degrees and codegrees. We find that the same exponents hold universally over this entire class of graphs provided that measurements are made using the hyperbolic geometry of their circle packings rather than their usual combinatorial geometry.

Recommendations

• scientific article; zbMATH DE number 1195780
• scientific article; zbMATH DE number 1123757
• Uniform spanning forests
• Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
• Minimal spanning forests

Cites work

• A self-avoiding random walk
• Boundaries of planar graphs, via circle packings
• Boundaries of planar graphs: a unified approach
• Choosing a spanning tree for the integer lattice uniformly
• Conformal invariance of planar loop-erased random walks and uniform spanning trees.
• Ends in uniform spanning forests
• Fixed points, Koebe uniformization and circle packings
• Growth exponent for loop-erased random walk in three dimensions
• Harmonic Dirichlet functions on planar graphs
• Harmonic functions on planar and almost planar graphs and manifolds, via circle packings
• scientific article; zbMATH DE number 2182144 (Why is no real title available?)
• scientific article; zbMATH DE number 3759178 (Why is no real title available?)
• scientific article; zbMATH DE number 1256746 (Why is no real title available?)
• scientific article; zbMATH DE number 2172004 (Why is no real title available?)
• scientific article; zbMATH DE number 1418385 (Why is no real title available?)
• scientific article; zbMATH DE number 2205220 (Why is no real title available?)
• scientific article; zbMATH DE number 4182261 (Why is no real title available?)
• scientific article; zbMATH DE number 3027510 (Why is no real title available?)
• Hyperbolic and parabolic packings
• Hyperbolic and parabolic unimodular random maps
• Inequalities for critical exponents in \(d\)-dimensional sandpiles
• Interlacements and the wired uniform spanning forest
• Layered circlepackings and the type problem
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Loop erased walks and uniform spanning trees
• Oded Schramm: from circle packing to SLE
• On the cover time of planar graphs
• On the rodin and sullivan ring lemma
• Probability on trees and networks
• Processes on unimodular random networks
• Quantum gravity and the KPZ formula [after Duplantier-Sheffield]
• Quasisymmetric uniformization and heat kernel estimates
• Random-cluster measures and uniform spanning trees
• Recurrence of distributional limits of finite planar graphs
• Recurrence of multiply-ended planar triangulations
• Recurrence of planar graph limits
• Representations of Planar Graphs
• Rigidity of Infinite (Circle) Packings
• Rigidity of infinite disk patterns
• Robust discrete complex analysis: a toolbox
• Scaling limits of loop-erased random walks and uniform spanning trees
• Spectral dimension and random walks on the two dimensional uniform spanning tree
• The \(C^\infty\)-convergence of hexagonal disk packings to the Riemann map
• The asymptotic determinant of the discrete Laplacian
• The components of the wired spanning forest are recurrent
• The convergence of circle packings to the Riemann mapping
• The growth exponent for planar loop-erased random walk
• The half plane UIPT is recurrent
• The sharp constant in the ring lemma
• Uniform spanning forests
• Unimodular hyperbolic triangulations: circle packing and random walk
• Wired cycle-breaking dynamics for uniform spanning forests

Cited in

(17)

• Interlacements and the wired uniform spanning forest
• Covering planar graphs with forests
• The \(L^2\) boundedness condition in nonamenable percolation
• Induced graphs of uniform spanning forests
• Weights of uniform spanning forests on nonunimodular transitive graphs
• The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set
• Indistinguishability of collections of trees in the uniform spanning forest
• Limits of random tree-like discrete structures
• The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\)
• Universality of high-dimensional spanning forests and sandpiles
• Indistinguishability of trees in uniform spanning forests
• Determinantal spanning forests on planar graphs
• Quasisymmetric uniformization and heat kernel estimates
• Loop-erased partitioning via parametric spanning trees: monotonicities \& 1D-scaling
• The union of independent USFs on \(\mathbb{Z}^d\) is transient
• The number of ends in the uniform spanning tree for recurrent unimodular random graphs
• The excluded minors for embeddability into a compact surface

Describes a project that uses

Uses Software

• CirclePack

This page was built for publication: Uniform spanning forests of planar graphs

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