Wired cycle-breaking dynamics for uniform spanning forests

DOI10.1214/15-AOP1063zbMath1364.05062arXiv1504.03928OpenAlexW3105155888MaRDI QIDQ504250

Tom Hutchcroft

Publication date: 13 January 2017

Published in: The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

random graphsunimodular random graphsspanning forestsreversible random graphs

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Connectivity (05C40)

Related Items (11)

Indistinguishability of trees in uniform spanning forests ⋮ Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting) ⋮ Indistinguishability of collections of trees in the uniform spanning forest ⋮ Uniform even subgraphs and graphical representations of Ising as factors of i.i.d. ⋮ Harnack inequality and one-endedness of UST on reversible random graphs ⋮ Logarithmic corrections to scaling in the four-dimensional uniform spanning tree ⋮ Interlacements and the wired uniform spanning forest ⋮ UNIFORM SPANNING FORESTS OF PLANAR GRAPHS ⋮ Universality of high-dimensional spanning forests and sandpiles ⋮ Weights of uniform spanning forests on nonunimodular transitive graphs ⋮ Hyperbolic and parabolic unimodular random maps

This page was built for publication: Wired cycle-breaking dynamics for uniform spanning forests