The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\)

DOI10.1007/s00440-018-0884-3zbMath1480.60021arXiv1702.05780OpenAlexW2595353273MaRDI QIDQ2273595

Tom Hutchcroft, Yuval Peres

Publication date: 24 September 2019

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

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

zbMATH Keywords

uniform spanning forestsubiquitous subgraphsubiquitous subhypergraphs

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) Combinatorial probability (60C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

Indistinguishability of collections of trees in the uniform spanning forest ⋮ Induced graphs of uniform spanning forests ⋮ Universality of high-dimensional spanning forests and sandpiles ⋮ Random walks with local memory ⋮ Harry Kesten's work in probability theory ⋮ Uniform spanning forests on biased Euclidean lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Geometry of the random interlacement
• Gaussian estimates for Markov chains and random walks on groups
• A note on bounded automorphisms of infinite graphs
• Vacant set of random interlacements and percolation
• A new proof of Moser's parabolic Harnack inequality using the old ideas of Nash
• A self-avoiding random walk
• Choosing a spanning tree for the integer lattice uniformly
• Parabolic Harnack inequality and estimates of Markov chains on graphs
• Markov chain intersections and the loop-erased walk
• Indistinguishability of percolation clusters
• Indistinguishability of the components of random spanning forests
• Interlacements and the wired uniform spanning forest
• Stability of the elliptic Harnack inequality
• Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
• Uniform spanning forests
• Random-cluster measures and uniform spanning trees
• Percolative properties of Brownian interlacements and its vacant set
• Indistinguishability of trees in uniform spanning forests
• Connectivity properties of random interlacement and intersection of random walks
• On the easiest way to connect $k$ points in the Random Interlacements process
• GRAPHS WITH POLYNOMIAL GROWTH
• Connectivity properties of Branching Interlacements
• Negative association in uniform forests and connected graphs
• Random Walks on Infinite Graphs and Groups
• UNIFORM SPANNING FORESTS OF PLANAR GRAPHS
• The strange logic of random graphs
• Connectedness of Poisson cylinders in Euclidean space

This page was built for publication: The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\)