INTERLACEMENTS AND THE WIRED UNIFORM SPANNING FOREST
INTERLACEMENTS AND THE WIRED UNIFORM SPANNING FOREST
About this item
Full title
Author / Creator
Publisher
Hayward: Institute of Mathematical Statistics
Journal title
Language
English
Formats
Publication information
Publisher
Hayward: Institute of Mathematical Statistics
Subjects
More information
Scope and Contents
Contents
We extend the Aldous–Broder algorithm to generate the wired uniform spanning forests (WUSFs) of infinite, transient graphs. We do this by replacing the simple random walk in the classical algorithm with Sznitman’s random interlacement process. We then apply this algorithm to study the WUSF, showing that every component of the WUSF is one-ended almo...
Alternative Titles
Full title
INTERLACEMENTS AND THE WIRED UNIFORM SPANNING FOREST
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2025320761
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2025320761
Other Identifiers
ISSN
0091-1798
E-ISSN
2168-894X
DOI
10.1214/17-AOP1203
