Let G be the Cartesian product of a regular tree T and a finite connected transitive graph H. It is shown in [3] that the Free Uniform Spanning Forest (FSF) of this graph may not be connected, but the dependence of this connectedness on H remains somewhat mysterious. We study the case when a positive weight w is put on the edges of the H-copies in G, and conjecture that the connectedness of the FSF exhibits a phase transition. For large enough w we show that the FSF is connected, while for a large family of H and T , the FSF is disconnected when w is small (relying on [3]). Finally, we prove that when H is the graph of one edge, then for any w, the FSF is a single tree, and we give an explicit formula for the distribution of the distance between two points within the tree.
Let G be the Cartesian product of a regular tree T and a finite connected transitive graph H. It is shown in [4] that the Free Uniform Spanning Forest (FSF) of this graph may not be connected, but the dependence of this connectedness on H remains somewhat mysterious. We study the case when a positive weight w is put on the edges of the H-copies in G, and conjecture that the connectedness of the FSF exhibits a phase transition. For large enough w we show that the FSF is connected, while for a wide family of H and T , the FSF is disconnected when w is small (relying on [4]). Finally, we prove that when H is the graph of one edge, then for any w, the FSF is a single tree, and we give an explicit formula for the distribution of the distance between two points within the tree.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.