×

Geometry of uniform spanning forest components in high dimensions. (English) Zbl 1472.60018

Summary: We study the geometry of the component of the origin in the uniform spanning forest of \(\mathbb{Z}^d\) and give bounds on the size of balls in the intrinsic metric.

MSC:

60D05 Geometric probability and stochastic geometry
60G50 Sums of independent random variables; random walks
05C05 Trees
31C20 Discrete potential theory

References:

[1] M.Aizenman and C. M.Newman, Tree graph inequalities and critical behavior in percolation models. J. Stat. Phys.36(1984), nos. 1/2, 107-143. https://doi.org/10.1007/BF01015729. · Zbl 0586.60096
[2] M. T.Barlow and R.Masson, Exponential tail bounds for loop-erased random walk in two dimensions. Ann. Probab.38(2010), no. 6, 2379-2417. https://doi.org/10.1214/10-AOP539. · Zbl 1207.60035
[3] M. T.Barlow and R.Masson, Spectral dimension and random walks on the two dimensional uniform spanning tree. Comm. Math. Phys.305(2011), 23-57. https://doi.org/10.1007/s00220-011-1251-8. · Zbl 1223.05285
[4] I.Benjamini, R.Lyons, Y.Peres, and O.Schramm, Uniform spanning forests. Ann. Probab.29(2001), 1-65. · Zbl 1016.60009
[5] S.Bhupatiraju, J.Hanson, and A. A.Járai, Inequalities for critical exponents in d-dimensional sandpiles. Electron. J. Probab.22(2017), paper no. 85, 1-51. https://doi.org/10.1214/17-EJP111. · Zbl 1386.60318
[6] Gregory F.Lawler, A self-avoiding random walk. Duke Math. J.47(1980), no. 3, 655-693. https://doi.org/10.1215/S0012-7094-80-04741-9. · Zbl 0445.60058
[7] Gregory F.Lawler, Intersections of random walks. Probability and its Applications. Birkhäuser Boston, Boston, MA, 1991. · Zbl 1228.60004
[8] Gregory F.Lawler, The logarithmic correction for loop-erased walk in four dimensions. In: Proceedings of the Conference in Honor of Jean-Pierre Kahane. J. Fourier Anal. Appl. (1995) Special Issue, 347-361. · Zbl 0889.60075
[9] Gregory F.Lawler, Loop-erased random walk. In: Perplexing problems in probability. Progress in probability, 44. Birkhäuser Boston, Boston, MA, 1999. · Zbl 0947.60055
[10] Gregory F.Lawler and VladaLimic, Random walk: a modern introduction. Cambridge University Press, 2009.
[11] R.Lyons, B. J.Morris, and O.Schramm, Ends in uniform spanning forests. Electron. J. Probab.13(2008), no. 58, 1702-1725. https://doi.org/10.1214/EJP.v13-566. · Zbl 1191.60016
[12] R.Lyons and Y.Peres, Probability on trees and networks. Cambridge Series in Statistical and Probabilistic Mathematics, 42. Cambridge University Press, New York, 2016. · Zbl 1376.05002
[13] RobertMasson, The growth exponent for planar loop-erased random walk. Electron. J. Probab.14(2009), no. 36, 1012-1073. https://doi.org/10.1214/EJP.v14-651. · Zbl 1191.60061
[14] R.Pemantle, Choosing a spanning tree for the integer lattice uniformly. Ann. Probab.19(1991), no. 4, 1559-1574. https://doi.org/10.1214/aop/1176990223. · Zbl 0758.60010
[15] D. B.Wilson, Generating spanning trees more quickly than the cover time. Proceedings of the Twenty-eighth Annual ACM Symposium on the Theory of Computing. ACM, New York, 1996, pp. 296-303. · Zbl 0946.60070
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.