The wired uniform spanning forest on an infinite connected locally finite graph is the weak limit of uniform spanning trees on finite exhaustions with the exterior identified to a single boundary vertex. Retain the tree edges internal to each finite region when taking the limit. The law may differ from the free uniform spanning forest, which leaves boundary vertices distinct. The choice of boundary convention is therefore part of the definition, even though both limits are probability laws on spanning forests of the same infinite graph.
Wired Uniform Spanning Forest
See also
Free Uniform Spanning Forest, Spanning Forest, Uniform Spanning Tree, Weak ConvergenceExplore with Wolfram|Alpha
References
Lyons, R. and Peres, Y. Probability on Trees and Networks. New York: Cambridge University Press, 2016. https://doi.org/10.1017/9781316672815.Cite this as:
Weisstein, Eric W. "Wired Uniform Spanning Forest." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/WiredUniformSpanningForest.html