Connectedness of the free uniform spanning forest as a function of edge weights

DOI10.1214/22-ECP453zbMATH Open1492.60018arXiv2011.12904MaRDI QIDQ2113269FDOQ2113269

Authors: Marcell Alexy, Márton Borbényi, András Imolay, Ádám Timár 

Publication date: 11 March 2022

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Abstract: Let $G$ be the Cartesian product of a regular tree $T$ and a finite connected transitive graph $H$. It is shown in arXiv:2006.06387 that the Free Uniform Spanning Forest ($mathsfFSF$) 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 $mathsfFSF$ exhibits a phase transition. For large enough $w$ we show that the $mathsfFSF$ is connected, while for a large family of $H$ and $T$, the $mathsfFSF$ is disconnected when $w$ is small (relying on arXiv:2006.06387). Finally, we prove that when $H$ is the graph of one edge, then for any $w$, the $mathsfFSF$ is a single tree, and we give an explicit formula for the distribution of the distance between two points within the tree.

Full work available at URL: https://arxiv.org/abs/2011.12904

Recommendations

• On weighted component edge connectivity of trees and unicycles
• Weights of uniform spanning forests on nonunimodular transitive graphs
• scientific article; zbMATH DE number 6000778
• Connectivity of random geometric graphs related to minimal spanning forests
• On the number of forests and connected spanning subgraphs
• Edge‐disjoint spanning trees: A connectedness theorem
• Edge-disjoint spanning trees and forests of graphs
• \(k\)-connectivity and decomposition of graphs into forests
• Couplings of uniform spanning forests

zbMATH Keywords

probabilityconnectednessinfinite graphuniform spanning treeinfinite treefree uniform spanning forest graphWilson-algorithm

Mathematics Subject Classification ID

Combinatorial probability (60C05) Infinite graphs (05C63)

Cites Work

• Title not available (Why is that?)
• Probability on trees and networks
• Choosing a spanning tree for the integer lattice uniformly
• Indistinguishability of the components of random spanning forests
• Indistinguishability of trees in uniform spanning forests
• Weights of uniform spanning forests on nonunimodular transitive graphs
• The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set

Cited In (3)

• Title not available (Why is that?)
• Weights of uniform spanning forests on nonunimodular transitive graphs
• The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set

This page was built for publication: Connectedness of the free uniform spanning forest as a function of edge weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113269)