Sampling random spanning trees faster than matrix multiplication
Work
Year: 2017
Type: article
Abstract: We present an algorithm that, with high probability, generates a random spanning tree from an edge-weighted undirected graph in (n5/3 m1/3) time. The tree is sampled from a distribution where the prob... more
Institutions Georgia Institute of Technology, Yale University, Massachusetts Institute of Technology, Google (United States)
Cites: 25
Cited by: 52
Related to: 10
FWCI: 7.833
Citation percentile (by year/subfield): 95.42
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Funder National Science Foundation
Grant ID 1065125