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

preprint2020arXivOpen access

Abstract

Let Uδ{\mathcal U}_δ be the uniform spanning tree on δZ3δ\mathbb{Z}^{3}. A spanning cluster of Uδ{\mathcal U}_δ is a connected component of the restriction of Uδ{\mathcal U}_δ 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δ\to 0, which resolves an open question raised by Benjamini (1999).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.