Connectedness of the free uniform spanning forest as a function of edge weights
From MaRDI portal
Publication:2113269
DOI10.1214/22-ECP453zbMath1492.60018arXiv2011.12904MaRDI QIDQ2113269
Ádám Timár, Marcell Alexy, András Imolay, Márton Borbényi
Publication date: 11 March 2022
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.12904
connectednessprobabilityinfinite graphinfinite treeuniform spanning treefree uniform spanning forest graphWilson-algorithm
Related Items
Cites Work
- Choosing a spanning tree for the integer lattice uniformly
- Indistinguishability of the components of random 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
- Indistinguishability of trees in uniform spanning forests
- Probability on Trees and Networks
- Unnamed Item