Sampling random spanning trees faster than matrix multiplication

David Durfee, Rasmus Kyng, John Peebles, Anup B. Rao, Sushant Sachdeva. Sampling random spanning trees faster than matrix multiplication. In Hamed Hatami, Pierre McKenzie, Valerie King, editors, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. pages 730-742, ACM, 2017. [doi]

Abstract

Abstract is missing.