Show simple item record

dc.contributor.authorHutchcroft, Tom
dc.date.accessioned2018-10-10T10:45:23Z
dc.date.available2018-10-10T10:45:23Z
dc.date.issued2016
dc.identifier.issn0091-1798
dc.identifier.urihttps://www.repository.cam.ac.uk/handle/1810/283542
dc.description.abstractWe prove that every component of the wired uniform spanning forest (WUSF) is one-ended almost surely in every transient reversible random graph, removing the bounded degree hypothesis required by earlier results. We deduce that every component of the WUSF is one-ended almost surely in every supercritical Galton-Watson tree, answering a question of Benjamini, Lyons, Peres and Schramm. Our proof introduces and exploits a family of Markov chains under which the oriented WUSF is stationary, which we call the wired cycle-breaking dynamics.
dc.publisherInstitute of Mathematical Statistics
dc.subjectmath.PR
dc.subjectmath.PR
dc.titleWired Cycle-Breaking Dynamics for Uniform Spanning Forests
dc.typeArticle
prism.endingPage3892
prism.issueIdentifier6
prism.publicationNameAnn. Probab.
prism.startingPage3879
prism.volume44
dc.identifier.doi10.17863/CAM.30905
rioxxterms.versionofrecord10.1214/15-AOP1063
rioxxterms.licenseref.urihttp://www.rioxx.net/licenses/all-rights-reserved
dc.contributor.orcidHutchcroft, Thomas [0000-0003-0061-593X]
rioxxterms.typeJournal Article/Review
cam.issuedOnline2016-11-14
rioxxterms.freetoread.startdate2017-11-30


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record