{"title":"均匀跨越森林的有线循环打破动力学","authors":"Tom Hutchcroft","doi":"10.1214/15-AOP1063","DOIUrl":null,"url":null,"abstract":"We prove that every component of the wired uniform spanning forest (WUSFWUSF) 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 WUSFWUSF is one-ended almost surely in every supercritical Galton–Watson tree, answering a question of Benjamini, Lyons, Peres and Schramm [Ann. Probab. 29 (2001) 1–65]. \n \nOur proof introduces and exploits a family of Markov chains under which the oriented WUSFWUSF is stationary, which we call the wired cycle-breaking dynamics.","PeriodicalId":50763,"journal":{"name":"Annals of Probability","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2015-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Wired cycle-breaking dynamics for uniform spanning forests\",\"authors\":\"Tom Hutchcroft\",\"doi\":\"10.1214/15-AOP1063\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We prove that every component of the wired uniform spanning forest (WUSFWUSF) 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 WUSFWUSF is one-ended almost surely in every supercritical Galton–Watson tree, answering a question of Benjamini, Lyons, Peres and Schramm [Ann. Probab. 29 (2001) 1–65]. \\n \\nOur proof introduces and exploits a family of Markov chains under which the oriented WUSFWUSF is stationary, which we call the wired cycle-breaking dynamics.\",\"PeriodicalId\":50763,\"journal\":{\"name\":\"Annals of Probability\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2015-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Probability\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1214/15-AOP1063\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"STATISTICS & PROBABILITY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Probability","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1214/15-AOP1063","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
Wired cycle-breaking dynamics for uniform spanning forests
We prove that every component of the wired uniform spanning forest (WUSFWUSF) 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 WUSFWUSF is one-ended almost surely in every supercritical Galton–Watson tree, answering a question of Benjamini, Lyons, Peres and Schramm [Ann. Probab. 29 (2001) 1–65].
Our proof introduces and exploits a family of Markov chains under which the oriented WUSFWUSF is stationary, which we call the wired cycle-breaking dynamics.
期刊介绍:
The Annals of Probability publishes research papers in modern probability theory, its relations to other areas of mathematics, and its applications in the physical and biological sciences. Emphasis is on importance, interest, and originality – formal novelty and correctness are not sufficient for publication. The Annals will also publish authoritative review papers and surveys of areas in vigorous development.