Show simple item record

dc.contributor.authorKelner, Jonathan Adam
dc.contributor.authorMadry, Aleksander
dc.date.accessioned2010-10-20T20:36:07Z
dc.date.available2010-10-20T20:36:07Z
dc.date.issued2010-03
dc.date.submitted2009-10
dc.identifier.isbn978-1-4244-5116-6
dc.identifier.issn0272-5428
dc.identifier.otherINSPEC Accession Number: 11207163
dc.identifier.urihttp://hdl.handle.net/1721.1/59437
dc.description.abstractIn 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+ d) of uniform in expected time O[over-(m[sqrt]n log 1/d).This improves the sparse graph case of the best previously known worst-case bound of O(min {mn, n[superscript 2.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.en_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/FOCS.2009.75en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceIEEEen_US
dc.subjectspanning treesen_US
dc.subjectrandom walks on graphsen_US
dc.subjectelectrical flowsen_US
dc.titleFaster generation of random spanning treesen_US
dc.typeArticleen_US
dc.identifier.citationKelner, J.A., and A. Madry. “Faster Generation of Random Spanning Trees.” Foundations of Computer Science, 2009. FOCS '09. 50th Annual IEEE Symposium on. 2009. 13-21. © 2009Institute of Electrical and Electronics Engineers.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematicsen_US
dc.contributor.approverKelner, Jonathan Adam
dc.contributor.mitauthorKelner, Jonathan Adam
dc.contributor.mitauthorMadry, Aleksander
dc.relation.journal50th Annual IEEE Symposium on Foundations of Computer Science, 2009. FOCS '09en_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsKelner, Jonathan A.; Madry, Aleksanderen
dc.identifier.orcidhttps://orcid.org/0000-0003-0536-0323
dc.identifier.orcidhttps://orcid.org/0000-0002-4257-4198
mit.licensePUBLISHER_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record