Faster Generation of Random Spanning Trees

12 years 4 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative (1 + δ) of uniform in expected time O(m √ n log 1/δ). This improves the sparse graph case of the best previously known worst-case bound of O(min{mn, n2.376 }), which has stood for twenty years. To achieve this goal, we exploit the connection between random walks on graphs and electrical networks, and we use this to introduce a new approach to the problem that integrates discrete random walk-based techniques with continuous linear algebraic methods. We believe that our use of electrical networks and sparse linear system solvers in conjunction with random walks and combinatorial partitioning techniques is a useful paradigm that will find further applications in algorithmic graph theory. ∗ Research partially supported by NSF grant CCF-0843915. † Research partially supported by Fulb...
Jonathan A. Kelner, Aleksander Madry
Added 20 May 2010
Updated 20 May 2010
Type Conference
Year 2009
Where FOCS
Authors Jonathan A. Kelner, Aleksander Madry
Comments (0)