A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees (Q6646407)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees |
scientific article; zbMATH DE number 7952096
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees |
scientific article; zbMATH DE number 7952096 |
Statements
A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees (English)
0 references
2 December 2024
0 references
uniform spanning tree
0 references
random walk
0 references
transient analysis
0 references
Wilson's algorithm
0 references
0 references
0 references
0 references
