Induced graphs of uniform spanning forests

  title={Induced graphs of uniform spanning forests},
  author={Russell Lyons and Yuval Peres and Xin Sun},
  journal={Annales de l'Institut Henri Poincar{\'e}, Probabilit{\'e}s et Statistiques},
  • R. Lyons, Y. Peres, Xin Sun
  • Published 7 December 2018
  • Mathematics
  • Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
Given a subgraph $H$ of a graph $G$, the induced graph of $H$ is the largest subgraph of $G$ whose vertex set is the same as that of $H$. Our paper concerns the induced graphs of the components of $\operatorname{WSF}(G)$, the wired spanning forest on $G$, and, to a lesser extent, $\operatorname{FSF}(G)$, the free uniform spanning forest. We show that the induced graph of each component of $\operatorname{WSF}(\mathbb Z^d$) is almost surely recurrent when $d\ge 8$. Moreover, the effective… 
2 Citations
Persistent Laplacians: properties, algorithms and implications
A thorough study of properties and algorithms for persistent Laplacians, which proves that the nullity of $\Delta_q^{K,L}$ gives rise to the $q-th persistent Betti number from $K$ to $L$.
Explicit universal minimal constants for polynomial growth of groups
Shalom and Tao showed that a polynomial upper bound on the size of a single, large enough ball in a Cayley graph implies that the underlying group has a nilpotent subgroup with index and degree of


The component graph of the uniform spanning forest: transitions in dimensions $$9,10,11,\ldots $$9,10,11,…
We prove that the uniform spanning forests of $$\mathbb {Z}^d$$Zd and $$\mathbb {Z}^{\ell }$$Zℓ have qualitatively different connectivity properties whenever $$\ell >d \ge 4$$ℓ>d≥4. In particular, we
Universality of high-dimensional spanning forests and sandpiles
We prove that the wired uniform spanning forest exhibits mean-field behaviour on a very large class of graphs, including every transitive graph of at least quintic volume growth and every bounded
Group-invariant Percolation on Graphs
Abstract. Let G be a closed group of automorphisms of a graph X. We relate geometric properties of G and X, such as amenability and unimodularity, to properties of G-invariant percolation processes
Uniform spanning forests
We study uniform spanning forest measures on infinite graphs, which are weak limits of uniform spanning tree measures from finite subgraphs. These limits can be taken with free (FSF) or wired (WSF)
Indistinguishability of trees in uniform spanning forests
We prove that in both the free and the wired uniform spanning forest (FUSF and WUSF) of any unimodular random rooted network (in particular, of any Cayley graph), it is impossible to distinguish the
Geometry of the Uniform Spanning Forest: Transitions in Dimensions 4, 8, 12
The uniform spanning forest (USF) in Z^d is the weak limit of random, uniformly chosen, spanning trees in [-n,n]^d. Pemantle proved that the USF consists a.s. of a single tree if and only if d = 9.
Interlacements and the wired uniform spanning forest
We extend the Aldous-Broder algorithm to generate the wired uniform spanning forests (WUSFs) of infinite, transient graphs. We do this by replacing the simple random walk in the classical algorithm
Random walk and electric currents in networks
Let G be a locally finite connected graph and c be a positive real-valued function defined on its edges. Let D (ξ) denote the sum of the values of c on the edges incident with a vertex ξ. A particle
Generating random spanning trees more quickly than the cover time
This paper gives a new algorithm for generating random spanning trees of an undirected graph that is easy to code up, has small running time constants, and has a nice proof that it generates trees with the right probabilities.
Conformal invariance of planar loop-erased random walks and uniform spanning trees
This paper proves that the scaling limit of a loop-erased random walk in a simply connected domain \(D\mathop \subset \limits_ \ne \mathbb{C} \) is equal to the radial SLE2 path. In particular, the