Let G be a finite graph or an infinite graph on which Z d acts with finite fundamental domain. If G is finite, let T be a random spanning tree chosen uniformly from all spanning trees of G; if G is ...

The Annals of Probability, Vol. 19, No. 4 (Oct., 1991), pp. 1559-1574 (16 pages) Consider the nearest neighbor graph for the integer lattice Z d in d dimensions. For a large finite piece of it, ...

Independent spanning trees, often realised as completely independent spanning trees (CISTs), form a foundational concept in network design and routing. They consist of multiple spanning trees ...

An algorithm that runs in network bridges and switches to prevent loops, in which packets keep going around in circles. In a small network with one or two switches, the spanning tree protocol (STP) ...