The number of spanning clusters of the uniform spanning tree in three dimensions
Probability
2020-03-11 v1 Combinatorics
Abstract
Let be the uniform spanning tree on . A spanning cluster of is a connected component of the restriction of to the unit cube that connects the left face to the right face . In this note, we will prove that the number of the spanning clusters is tight as , which resolves an open question raised by Benjamini (1999).
Cite
@article{arxiv.2003.04548,
title = {The number of spanning clusters of the uniform spanning tree in three dimensions},
author = {Omer Angel and David A. Croydon and Sarai Hernandez-Torres and Daisuke Shiraishi},
journal= {arXiv preprint arXiv:2003.04548},
year = {2020}
}
Comments
8 pages, 1 figure