Indistinguishability of trees in uniform spanning forests
- Creators
-
Hutchcroft, Tom
-
Nachmias, Asaf
Abstract
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 assumption of unimodularity. We prove that on any unimodular random rooted network, the FUSF is either connected or has infinitely many connected components almost surely, and, if the FUSF and WUSF are distinct, then every component of the FUSF is transient and infinitely-ended almost surely. All of these results are new even for Cayley graphs.
Additional Information
© Springer-Verlag Berlin Heidelberg 2016. Received: 22 October 2015 / Revised: 2 April 2016 / Published online: 16 April 2016. We are grateful to Russ Lyons for many comments, corrections and improvements to the manuscript, and also to Ander Holroyd and Yuval Peres for useful discussions. TH thanks Tel Aviv University and both authors thank the Issac Newton Institute, where part of this work was carried out, for their hospitality. This Project is supported by NSERC.Attached Files
Accepted Version - 1506.00556.pdf
Files
| Name | Size | Download all |
|---|---|---|
|
md5:b6605c72b4f6035671ee5d6b78891336
|
617.8 kB | Preview Download |
Additional details
- Eprint ID
- 111022
- DOI
- 10.1007/s00440-016-0707-3
- Resolver ID
- CaltechAUTHORS:20210923-225150172
- Natural Sciences and Engineering Research Council of Canada (NSERC)
- Created
-
2021-09-27Created from EPrint's datestamp field
- Updated
-
2021-09-27Created from EPrint's last_modified field