A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/2206.12378/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTA transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees — mentioned by Arcorannhttps://news.ycombinator.com/item?id=41343766urn:hackerpapers:mention:2206.12378:41343766Sun, 25 Aug 2024 02:14:51 GMT<p>&gt; I also read that starting with Aldous Broder and then switching to Wilson&#x27;s Algorithm (reasoning: Aldous Broder is slow at the end, Wilson&#x27;s Algorithm is slow at the start) is faster than either. However, I haven&#x27;t seen proof that this combination still results in a uniform spanning tree (where all possible mazes have equal probability). I did some searching, and the paper at [1] (2022) studies the problem. Based on the paper, a naive combination of the two algorithms can generate uniform spanning trees on complete graphs, but more work is needed for arbitrary graphs. [2] apparently cites…</p><p><a href="https://hackerpaper.kaipfister.de/p/2206.12378/">Paper and discussion history</a>. A mention is not an endorsement.</p>math.CO