arXiv Analytics

Sign in

arXiv:2006.06387 [math.PR]AbstractReferencesReviewsResources

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

Gábor Pete, Ádám Timár

Published 2020-06-11Version 1

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 infinitely many trees almost surely. This shows that the number of trees in the FUSF is not a quasi-isometry invariant. Moreover, we give two different Cayley graphs of the same virtually free group such that the FUSF has infinitely many trees in one, but is connected in the other, answering a question of Lyons and Peres (2016) in the negative. A version of our argument gives an example of a non-unimodular transitive graph where WUSF\not=FUSF, but some of the FUSF trees are light with respect to Haar measure. This disproves a conjecture of Tang (2019).

Related articles: Most relevant | Search more
arXiv:2104.05607 [math.PR] (Published 2021-04-12)
Non-triviality of the phase transition for percolation on finite transitive graphs
arXiv:2408.12039 [math.PR] (Published 2024-08-21)
Sharpness and locality for percolation on finite transitive graphs
arXiv:2011.12904 [math.PR] (Published 2020-11-25)
Connectedness of the Free Uniform Spanning Forest as a function of edge weights