A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees

Igor Nunes, Giulio Iacobelli, Daniel Ratton Figueiredo

The $Aldous\text{-}Broder$ and $Wilson$ are two well-known algorithms to generate uniform spanning trees (USTs) based on random walks. This work studies their relationship while th…