# Indistinguishability of trees in uniform spanning forests

@article{Hutchcroft2015IndistinguishabilityOT, title={Indistinguishability of trees in uniform spanning forests}, author={Tom Hutchcroft and Asaf Nachmias}, journal={Probability Theory and Related Fields}, year={2015}, volume={168}, pages={113-152} }

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 connected components of the forest from each other by invariantly defined graph properties almost surely. This confirms a conjecture of Benjamini et al. (Ann Probab 29(1):1–65, 2001). We also answer positively two additional questions of Benjamini et al. (Ann Probab 29(1):1–65, 2001) under the…

## 17 Citations

The Free Uniform Spanning Forest is disconnected in some virtually free groups, depending on the generator set

- Mathematics
- 2020

We prove the rather counterintuitive result that there exist finite transitive graphs H and integers k such that the Free Uniform Spanning Forest in the direct product of the k-regular tree and H has…

Indistinguishability of the components of random spanning forests

- MathematicsThe Annals of Probability
- 2018

We prove that the infinite components of the Free Uniform Spanning Forest of a Cayley graph are indistinguishable by any invariant property, given that the forest is different from its wired…

Indistinguishability of collections of trees in the uniform spanning forest

- Mathematics
- 2018

We prove the following indistinguishability theorem for $k$-tuples of trees in the uniform spanning forest of $\mathbb{Z}^d$: Suppose that $\mathscr{A}$ is a property of a $k$-tuple of components…

INTERLACEMENTS AND THE WIRED UNIFORM SPANNING FOREST BY TOM HUTCHCROFT

- Mathematics
- 2018

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…

Weights of uniform spanning forests on nonunimodular transitive graphs

- MathematicsElectronic Journal of Probability
- 2021

Considering the wired uniform spanning forest on a nonunimodular transitive graph, we show that almost surely each tree of the wired uniform spanning forest is light. More generally we study the…

Loop-erased partitioning of cycle-free graphs

- Mathematics
- 2021

We consider random partitions of the vertex set of a given finite graph that can be sampled by means of loop-erased random walks stopped at a random independent exponential time of parameter q > 0.…

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

- MathematicsProbability Theory and Related Fields
- 2018

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…

Edge sliding and ergodic hyperfinite decomposition

- Mathematics
- 2017

We use edge slidings and saturated disjoint Borel families to give a conceptually simple proof of Hjorth's theorem on cost attained: if a countable p.m.p. ergodic equivalence relation $E$ is treeable…

Probability on Trees and Networks

- Mathematics
- 2017

Starting around the late 1950s, several research communities began relating the geometry of graphs to stochastic processes on these graphs. This book, twenty years in the making, ties together…

Pointwise ergodic theorem for locally countable quasi-pmp graphs

- Mathematics
- 2018

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, analogous to pointwise ergodic theorems for group actions, replacing the…

## References

SHOWING 1-10 OF 49 REFERENCES

Indistinguishability of the components of random spanning forests

- MathematicsThe Annals of Probability
- 2018

We prove that the infinite components of the Free Uniform Spanning Forest of a Cayley graph are indistinguishable by any invariant property, given that the forest is different from its wired…

Wired cycle-breaking dynamics for uniform spanning forests

- Mathematics
- 2016

We prove that every component of the wired uniform spanning forest (WUSFWUSF) is one-ended almost surely in every transient reversible random graph, removing the bounded degree hypothesis required by…

Group-invariant Percolation on Graphs

- Mathematics
- 1999

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…

Generating random spanning trees more quickly than the cover time

- Computer ScienceSTOC '96
- 1996

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.

The components of the Wired Spanning Forest are recurrent

- Mathematics
- 2003

Abstract We show that a.s. all of the connected components of the Wired Spanning Forest are recurrent, proving a conjecture of Benjamini, Lyons, Peres and Schramm. Our analysis relies on a simple…

Scaling limits of loop-erased random walks and uniform spanning trees

- Mathematics
- 1999

AbstractThe uniform spanning tree (UST) and the loop-erased random walk (LERW) are strongly related probabilistic processes. We consider the limits of these models on a fine grid in the plane, as the…

Random Complexes and l^2-Betti Numbers

- Mathematics
- 2008

Uniform spanning trees on finite graphs and their analogues on infinite graphs are a well-studied area. On a Cayley graph of a group, we show that they are related to the first $\ell^2$-Betti number…

Ends in Uniform Spanning Forests

- Mathematics
- 2007

It has hitherto been known that in a transitive unimodular graph, each tree in the wired spanning forest has only one end a.s. We dispense with the assumptions of transitivity and unimodularity,…

Indistinguishability of Percolation Clusters

- Mathematics
- 1998

We show that when percolation produces infinitely many infinite clusters on a Cayley graph, one cannot distinguish the clusters from each other by any invariantly defined property. This implies that…

Conformal invariance of planar loop-erased random walks and uniform spanning trees

- Mathematics
- 2001

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…