Skip to main content
×
×
Home

Geometry of Uniform Spanning Forest Components in High Dimensions

  • Martin T. Barlow (a1) and Antal A. Járai (a2)
Abstract

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.

Copyright
Footnotes
Hide All

Research partially supported by NSERC (Canada).

Footnotes
References
Hide All
[AN] Aizenman, M. and Newman, C. M., Tree graph inequalities and critical behavior in percolation models . J. Stat. Phys. 36(1984), nos. 1/2, 107143. https://doi.org/10.1007/BF01015729.
[BM1] Barlow, M. T. and Masson, R., Exponential tail bounds for loop-erased random walk in two dimensions . Ann. Probab. 38(2010), no. 6, 23792417. https://doi.org/10.1214/10-AOP539.
[BM2] Barlow, M. T. and Masson, R., Spectral dimension and random walks on the two dimensional uniform spanning tree . Comm. Math. Phys. 305(2011), 2357. https://doi.org/10.1007/s00220-011-1251-8.
[BLPS] Benjamini, I., Lyons, R., Peres, Y., and Schramm, O., Uniform spanning forests . Ann. Probab. 29(2001), 165.
[BHJ] Bhupatiraju, S., Hanson, J., and Járai, A. A., Inequalities for critical exponents in d-dimensional sandpiles . Electron. J. Probab. 22(2017), paper no. 85, 151. https://doi.org/10.1214/17-EJP111.
[La1] Lawler, Gregory F., A self-avoiding random walk . Duke Math. J. 47(1980), no. 3, 655693. https://doi.org/10.1215/S0012-7094-80-04741-9.
[La2] Lawler, Gregory F., Intersections of random walks . Probability and its Applications. Birkhäuser Boston, Boston, MA, 1991.
[La3] Lawler, Gregory F., 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.
[Law99] Lawler, Gregory F., Loop-erased random walk . In: Perplexing problems in probability. Progress in probability, 44. Birkhäuser Boston, Boston, MA, 1999.
[LL] Lawler, Gregory F. and Limic, Vlada, Random walk: a modern introduction. Cambridge University Press, 2009.
[LMS] Lyons, R., Morris, B. J., and Schramm, O., Ends in uniform spanning forests . Electron. J. Probab. 13(2008), no. 58, 17021725. https://doi.org/10.1214/EJP.v13-566.
[LP] Lyons, R. and Peres, Y., Probability on trees and networks. Cambridge Series in Statistical and Probabilistic Mathematics, 42. Cambridge University Press, New York, 2016.
[Mas] Masson, Robert, The growth exponent for planar loop-erased random walk . Electron. J. Probab. 14(2009), no. 36, 10121073. https://doi.org/10.1214/EJP.v14-651.
[Pem91] Pemantle, R., Choosing a spanning tree for the integer lattice uniformly . Ann. Probab. 19(1991), no. 4, 15591574. https://doi.org/10.1214/aop/1176990223.
[W] Wilson, D. B., 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. 296303.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Canadian Journal of Mathematics
  • ISSN: 0008-414X
  • EISSN: 1496-4279
  • URL: /core/journals/canadian-journal-of-mathematics
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

Keywords

MSC classification

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed