Exhaust by finite boxes and let be a uniform spanning tree of . Every finite tree satisfies the handshaking lemma, soChoose the root uniformly from . The proportion of roots within any fixed distance of the boundary tends to zero, and the rooted trees converge locally to the uniform spanning tree of . Since every degree is at most four, expectations also converge. Translation invariance therefore givesThe four edges incident to have equal inclusion probability by the rotations and reflections of the square lattice. If that common probability is , then . Consequentlyfor every edge by translation invariance.
Articles by others on the same topic
There are currently no matching articles.