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

DOI10.1007/S00440-018-0884-3MaRDI QIDQ2273595zbMATH OpenOpenAlexFDO

Authors Tom Hutchcroft, Yuval Peres

Publication date 24 September 2019

Published in Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

ubiquitous subgraphsubiquitous subhypergraphsuniform spanning forests

Mathematics Subject Classification ID

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

Abstract: We prove that the uniform spanning forests of $mathbb{Z}^d$ and $mathbb{Z}^{ell}$ have qualitatively different connectivity properties whenever $ell>dgeq4$. In particular, we consider the graph formed by contracting each tree of the uniform spanning forest down to a single vertex, which we call the component graph. We introduce the notion of ubiquitous subgraphs and show that the set of ubiquitous subgraphs of the component graph changes whenever the dimension changes and is above $8$. To separate dimensions $5,6,7,$ and $8$, we prove a similar result concerning ubiquitous subhypergraphs in the component hypergraph. Our result sharpens a theorem of Benjamini, Kesten, Peres, and Schramm, who proved that the diameter of the component graph increases by one every time the dimension increases by four.

Recommendations

• Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
• Uniform spanning forests of planar graphs
• scientific article; zbMATH DE number 1195780
• Induced graphs of uniform spanning forests
• The diameter of uniform spanning trees in high dimensions

Cites work

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

Cited in

(10)

• Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
• Induced graphs of uniform spanning forests
• Random walks with local memory
• Harry Kesten's work in probability theory
• Uniform spanning forests on biased Euclidean lattices
• Indistinguishability of collections of trees in the uniform spanning forest
• Universality of high-dimensional spanning forests and sandpiles
• The diameter of uniform spanning trees in high dimensions
• Percolation transition for random forests in d 3
• The union of independent USFs on \(\mathbb{Z}^d\) is transient

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

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