Open Access
2022 Connectedness of the Free Uniform Spanning Forest as a function of edge weights
Marcell Alexy, Márton Borbényi, András Imolay, Ádám Timár
Author Affiliations +
Electron. Commun. Probab. 27: 1-12 (2022). DOI: 10.1214/22-ECP453


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.


The first three authors would like to thank the Rényi REU 2020 program for undergraduate research. The third author is partially supported by the ÚNKP-20-1 New National Excellence Program of the Ministry for Innovation and Technology from the source of the National Research, Development and Innovation Fund.

The last author was partially supported by the ERC Consolidator Grant 772466 “NOISE”, and by Icelandic Research Fund Grant 185233-051.


Download Citation

Marcell Alexy. Márton Borbényi. András Imolay. Ádám Timár. "Connectedness of the Free Uniform Spanning Forest as a function of edge weights." Electron. Commun. Probab. 27 1 - 12, 2022.


Received: 31 July 2021; Accepted: 29 January 2022; Published: 2022
First available in Project Euclid: 23 February 2022

arXiv: 2011.12904
MathSciNet: MR4386038
zbMATH: 1492.60018
Digital Object Identifier: 10.1214/22-ECP453

Primary: 60C05

Keywords: connectedness , Free Uniform Spanning Forest graph , graph product , infinite graph , infinite tree , Probability , Uniform spanning tree , Wilson-algorithm

Back to Top