Fast Generation of Random Spanning Trees and the Effective Resistance Metric.
Lists
Only you see this
Abstract
We present a new algorithm for generating a uniformly random spanning tree in an undirected graph. Our algorithm samples such a tree in expected $\tilde{O}(m^{4/3})$ time. This improves over the best previously known bound of $\min(\tilde{O}(m\sqrt{n}),O(n^{\omega}))$ -- that follows from the work of Kelner and M\k{a}dry [FOCS'09] and of Colbourn et al. [J. Algorithms'96] -- whenever the input graph is sufficiently sparse. At a high level, our result stems from carefully exploiting the interplay of random spanning trees, random walks, and the notion of effective resistance, as well as from devising a way to algorithmically relate these concepts to the combinatorial structure of the graph. This involves, in particular, establishing a new connection between the effective resistance metric and the cut structure of the underlying graph.
BibTeX
@inproceedings{madry2015fast,
author = {Aleksander Madry and Damian Straszak and Jakub Tarnawski},
title = {{Fast Generation of Random Spanning Trees and the Effective Resistance Metric.}},
booktitle = {SODA},
year = {2015},
doi = {10.1137/1.9781611973730.134},
}Loading related content...