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

arxiv(2020)

引用 0|浏览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).
更多
查看译文
关键词
Free Uniform Spanning Forest,Wilson's algorithm,virtually free groups,nonunimod-ular transitive graphs,nonuniversality at criticality
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要