Indistinguishability of trees in uniform spanning forests

DOI10.1007/s00440-016-0707-3zbMath1407.60019arXiv1506.00556OpenAlexW565170798MaRDI QIDQ2359739

Asaf Nachmias, Tom Hutchcroft

Publication date: 22 June 2017

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

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

zbMATH Keywords

Cayley graphuniform spanning forests

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (15)

Indistinguishability of the components of random spanning forests ⋮ Surviving ends in Bernoulli percolation on graphs roughly isometric to a tree ⋮ Indistinguishability of collections of trees in the uniform spanning forest ⋮ Heavy Bernoulli-percolation clusters are indistinguishable ⋮ Anomalous diffusion of random walk on random planar maps ⋮ Pointwise ergodic theorem for locally countable quasi-pmp graphs ⋮ Harmonic Dirichlet functions on planar graphs ⋮ Interlacements and the wired uniform spanning forest ⋮ The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\) ⋮ Supercritical causal maps: geodesics and simple random walk ⋮ Induced graphs of uniform spanning forests ⋮ Weights of uniform spanning forests on nonunimodular transitive graphs ⋮ Hyperbolic and parabolic unimodular random maps ⋮ The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set ⋮ Connectedness of the free uniform spanning forest as a function of edge weights

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ergodic theory on stationary random graphs
• Minimal configurations and sandpile measures
• Wired cycle-breaking dynamics for uniform spanning forests
• Gaussian estimates for Markov chains and random walks on groups
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Unimodular hyperbolic triangulations: circle packing and random walk
• Planar stochastic hyperbolic triangulations
• A measurable-group-theoretic solution to von Neumann's problem
• Ends in uniform spanning forests
• A self-avoiding random walk
• Choosing a spanning tree for the integer lattice uniformly
• Group-invariant percolation on graphs
• The components of the wired spanning forest are recurrent
• Indistinguishability of percolation clusters
• Anchored expansion, speed and the Poisson-Voronoi tessellation in symmetric spaces
• Indistinguishability of the components of random spanning forests
• Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
• Uniform spanning forests
• Random-cluster measures and uniform spanning trees
• Processes on unimodular random networks
• The Canophy graph and level statistics for random operators on trees
• Infinite volume limit of the abelian sandpile model in dimensions \(d \geq 3\)
• Invariant percolation and harmonic Dirichlet functions
• Probability on Trees and Networks
• RANDOM COMPLEXES AND ℓ²-BETTI NUMBERS
• Chip-Firing and Rotor-Routing on Directed Graphs
• Nonunitarizable Representations and Random Forests
• How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
• The asymptotic determinant of the discrete Laplacian

This page was built for publication: Indistinguishability of trees in uniform spanning forests