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).
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.