Weights of uniform spanning forests on nonunimodular transitive graphs. (English) Zbl 1492.60294
Summary: Considering the wired uniform spanning forest on a nonunimodular transitive graph, we show that almost surely each tree of the wired uniform spanning forest is light. More generally we study the tilted volumes for the trees in the wired uniform spanning forest.
Regarding the free uniform spanning forest, we consider several families of nonunimodular transitive graphs. We show that the free uniform spanning forest is the same as the wired one on Diestel-Leader graphs. For grandparent graphs, we show that the free uniform spanning forest is connected and has branching number bigger than one. We also show that each tree of the free uniform spanning forest is heavy and has branching number bigger than one on a free product of a nonunimodular transitive graph with one edge when the free uniform spanning forest is not the same as the wired.
Regarding the free uniform spanning forest, we consider several families of nonunimodular transitive graphs. We show that the free uniform spanning forest is the same as the wired one on Diestel-Leader graphs. For grandparent graphs, we show that the free uniform spanning forest is connected and has branching number bigger than one. We also show that each tree of the free uniform spanning forest is heavy and has branching number bigger than one on a free product of a nonunimodular transitive graph with one edge when the free uniform spanning forest is not the same as the wired.
MSC:
| 60K35 | Interacting random processes; statistical mechanics type models; percolation theory |
References:
| [1] | Krishna B. Athreya and Peter E. Ney, Branching processes, Springer-Verlag, New York-Heidelberg, 1972, Die Grundlehren der mathematischen Wissenschaften, Band 196. |
| [2] | Itai Benjamini, Russell Lyons, Yuval Peres, and Oded Schramm, Group-invariant percolation on graphs, Geom. Funct. Anal. 9 (1999), no. 1, 29-66. · Zbl 0924.43002 |
| [3] | Itai Benjamini, Russell Lyons, Yuval Peres, and Oded Schramm, Uniform spanning forests, Ann. Probab. 29 (2001), no. 1, 1-65. · Zbl 1016.60009 |
| [4] | Reinhard Diestel and Imre Leader, A conjecture concerning a limit of non-Cayley graphs, J. Algebraic Combin. 14 (2001), no. 1, 17-25. · Zbl 0985.05020 |
| [5] | Rick Durrett, Probability—theory and examples, Cambridge Series in Statistical and Probabilistic Mathematics, vol. 49, Cambridge University Press, Cambridge, 2019, Fifth edition of [MR1068527]. · Zbl 1440.60001 |
| [6] | Alex Eskin, David Fisher, and Kevin Whyte, Coarse differentiation of quasi-isometries I: Spaces not quasi-isometric to Cayley graphs, Ann. of Math. (2) 176 (2012), no. 1, 221-260. · Zbl 1264.22005 |
| [7] | Geoffrey Grimmett, Percolation, second ed., Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 321, Springer-Verlag, Berlin, 1999. · Zbl 0926.60004 |
| [8] | Olle Häggström, Uniform and minimal essential spanning forests on trees, Random Structures Algorithms 12 (1998), no. 1, 27-50. · Zbl 0895.60099 |
| [9] | Tom Hutchcroft, Wired cycle-breaking dynamics for uniform spanning forests, Ann. Probab. 44 (2016), no. 6, 3879-3892. · Zbl 1364.05062 |
| [10] | Tom Hutchcroft, Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs, J. Amer. Math. Soc. 33 (2020), no. 4, 1101-1165. · Zbl 1451.05106 |
| [11] | Tom Hutchcroft, Universality of high-dimensional spanning forests and sandpiles, Probab. Theory Related Fields 176 (2020), no. 1-2, 533-597. · Zbl 1434.60296 |
| [12] | Tom Hutchcroft and Asaf Nachmias, Indistinguishability of trees in uniform spanning forests, Probab. Theory Related Fields 168 (2017), no. 1-2, 113-152. · Zbl 1407.60019 |
| [13] | Antal A. Járai and Frank Redig, Infinite volume limit of the abelian sandpile model in dimensions \[d\ge 3\], Probab. Theory Related Fields 141 (2008), no. 1-2, 181-212. · Zbl 1135.60342 |
| [14] | Gregory F. Lawler, Loop-erased random walk, Perplexing problems in probability, Progr. Probab., vol. 44, Birkhäuser Boston, Boston, MA, 1999, pp. 197-217. · Zbl 0947.60055 |
| [15] | Gregory F. Lawler, Topics in loop measures and the loop-erased walk, Probab. Surv. 15 (2018), 28-101. · Zbl 1390.60301 |
| [16] | Russell Lyons, A simple path to Biggins’ martingale convergence for branching random walk, Classical and modern branching processes (Minneapolis, MN, 1994), IMA Vol. Math. Appl., vol. 84, Springer, New York, 1997, pp. 217-221. · Zbl 0897.60086 |
| [17] | Russell Lyons, Benjamin J. Morris, and Oded Schramm, Ends in uniform spanning forests, Electron. J. Probab. 13 (2008), no. 58, 1702-1725. · Zbl 1191.60016 |
| [18] | Russell Lyons and Yuval Peres, Probability on trees and networks, Cambridge Series in Statistical and Probabilistic Mathematics, vol. 42, Cambridge University Press, New York, 2016, Available at http://pages.iu.edu/rdlyons/. · Zbl 1376.05002 |
| [19] | A. G. Pakes, On the critical Galton-Watson process with immigration, J. Austral. Math. Soc. 12 (1971), 476-482. · Zbl 0249.60045 |
| [20] | Erol A. Peköz and Adrian Röllin, New rates for exponential approximation and the theorems of Rényi and Yaglom, Ann. Probab. 39 (2011), no. 2, 587-608. · Zbl 1213.60049 |
| [21] | Robin Pemantle, Choosing a spanning tree for the integer lattice uniformly, Ann. Probab. 19 (1991), no. 4, 1559-1574. · Zbl 0758.60010 |
| [22] | Gábor Pete and Ádám Timár, The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set, arXiv preprint 2006.06387v1 (2020). |
| [23] | Paolo M. Soardi, Potential theory on infinite networks, Lecture Notes in Mathematics, vol. 1590, Springer-Verlag, Berlin, 1994. · Zbl 0818.31001 |
| [24] | Pengfei Tang, Heavy Bernoulli-percolation clusters are indistinguishable, Ann. Probab. 47 (2019), no. 6, 4077-4115. · Zbl 1453.60161 |
| [25] | Ádám Timár, Percolation on nonunimodular transitive graphs, Ann. Probab. 34 (2006), no. 6, 2344-2364. · Zbl 1114.60083 |
| [26] | Ádám Timár, Indistinguishability of the components of random spanning forests, Ann. Probab. 46 (2018), no. 4, 2221-2242. · Zbl 1430.60020 |
| [27] | V. I. Trofimov, Groups of automorphisms of graphs as topological groups, Mat. Zametki 38 (1985), no. 3, 378-385, 476. · Zbl 0596.05033 |
| [28] | C. Z. Wei, Convergence rates for the critical branching process with immigration, Statist. Sinica 1 (1991), no. 1, 175-184. · Zbl 0822.60077 |
| [29] | Wolfgang Woess, Random walks on infinite graphs and groups, Cambridge Tracts in Mathematics, vol. 138, Cambridge University Press, Cambridge, 2000. · Zbl 0951.60002 |
| [30] | Wolfgang Woess, Lamplighters, Diestel-Leader graphs, random walks, and harmonic functions, Combin. Probab. Comput. 14 (2005), no. 3, 415-433. · Zbl 1066.05075 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
