English

The number of spanning clusters of the uniform spanning tree in three dimensions

Probability 2020-03-11 v1 Combinatorics

Abstract

Let Uδ{\mathcal U}_{\delta} be the uniform spanning tree on δZ3\delta \mathbb{Z}^{3}. A spanning cluster of Uδ{\mathcal U}_{\delta} is a connected component of the restriction of Uδ{\mathcal U}_{\delta} to the unit cube [0,1]3[0,1]^{3} that connects the left face {0}×[0,1]2\{ 0 \} \times [0,1]^{2} to the right face {1}×[0,1]2\{ 1 \} \times [0,1]^{2}. In this note, we will prove that the number of the spanning clusters is tight as δ0\delta \to 0, which resolves an open question raised by Benjamini (1999).

Keywords

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