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