Abstract
We study the simple random walk on the uniform spanning tree on \({\mathbb {Z}^2}\) . We obtain estimates for the transition probabilities of the random walk, the distance of the walk from its starting point after n steps, and exit times of both Euclidean balls and balls in the intrinsic graph metric. In particular, we prove that the spectral dimension of the uniform spanning tree on \({\mathbb {Z}^2}\) is 16/13 almost surely.
Similar content being viewed by others
References
Aldous D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs. Book in preparation. http://www.stat.berkeley.edu/~aldous/RWG/book.html, 2002
Barlow M.T.: Which values of the volume growth and escape time exponent are possible for a graph?. Rev. Mat. Iberoam. 20(1), 1–31 (2004)
Barlow M.T., Bass R.F.: The construction of Brownian motion on the Sierpinski carpet. Ann. Inst. H. Poincaré 25, 225–257 (1989)
Barlow M.T., Coulhon T., Kumagai T.: Characterization of sub-Gaussian heat kernel estimates on strongly recurrent graphs. Comm. Pure Appl. Math. 58, 1642–1677 (2005)
Barlow M.T., Járai A., Kumagai T., Slade G.: Random walk on the incipient infinite cluster for oriented percolation in high dimensions. Commun. Math. Phys. 278(2), 385–431 (2008)
Barlow M.T., Kumagai T.: Random walk on the incipient infinite cluster on trees. Illinois J. Math. 50(1–4), 33–65 (2006)
Barlow M.T., Masson R.: Exponential tail bounds for loop-erased random walk in two dimensions. Ann. Probab. 38(6), 2379–2417 (2010)
Benjamini I., Kesten H., Peres Y., Schramm O.: Geometry of the uniform spanning forest: transitions in dimensions 4,8,12, . . .. Ann. of Math. 160(2), 465–491 (2004)
Benjamini I., Lyons R., Peres Y., Schramm O.: Uniform spanning forests. Ann. Probab. 29(1), 1–65 (2001)
Carne T.K.: A transmutation formula for Markov chains. Bull. Sci. Math. 109, 399–405 (1985)
Doyle, P.G., Snell, J.L.: Random Walks and Electric Networks. Washington DC: Mathematical Association of America, 1984, available at http://xxx.lanl.gov/abs/math/0001057v1 [math. PR], 2000
Häggstrøm O.: Random-cluster measures and uniform spanning trees. Stoch. Proc. App. 59, 267–275 (1995)
Kenyon R.: The asymptotic determinant of the discrete Laplacian. Acta Math. 185(2), 239–286 (2000)
Kozma G., Nachmias A.: The Alexander-Orbach conjecture holds in high dimensions. Invent. Math. 178(3), 635–654 (2009)
Kumagai T., Misumi J.: Heat kernel estimates for strongly recurrent random walk on random media. J. Theor. Prob. 21(4), 910–935 (2008)
Lawler, G. F.: Intersections of random walks. In: Probability and its Applications. Boston, MA: Birkhäuser Boston Inc., 1991
Lawler G.F., Limic V.: Random walk: a modern introduction. Cambridge Univ. Press, Cambridge (2010)
Lawler G.F., Schramm O., Werner W.: Conformal invariance of planar loop-erased random walks and uniform spanning trees. Ann. Probab. 32(1B), 939–995 (2004)
Lyons, R.: A bird’s-eye view of uniform spanning trees and forests. In: Microsurveys in discrete probability (Princeton, NJ, 1997), DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 41, Providence, RI: Amer. Math. Soc., 1998, pp. 135–162
Lyons, R., Peres, Y.: Probability on Trees and Networks. Book in preparation. http://mypage.iu.edu/~rdlyons/prbtree/prbtree.html, 2011
Masson R.: The growth exponent for planar loop-erased random walk. Electron. J. Probab. 14(36), 1012–1073 (2009)
Nash-Williams C.St J. A.: Random walks and electric currents in networks. Proc. Camb. Phil. Soc. 55, 181–194 (1959)
Pemantle R.: Choosing a spanning tree for the integer lattice uniformly. Ann. Probab. 19(4), 1559–1574 (1991)
Peres, Y., Revelle, D.: Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs. Preprint, available at http://front.math.ucdavis.edu/0410.5430, 2005
Schramm O.: Scaling limits of loop-erased random walks and uniform spanning trees. Israel J. Math. 118, 221–288 (2000)
Schweinsberg J.: Loop-erased random walk on finite graphs and the Rayleigh process. J. Theor. Prob. 21(2), 378–396 (2008)
Schweinsberg J.: The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus. Probab. Theory Rel. Fields 144(3–4), 319–370 (2009)
Wilson, D.B.: Generating random spanning trees more quickly than the cover time. In: Proceedings of the Twenty-eighth Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996), New York: ACM, 1996, pp. 296–303
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by F.L. Toninelli
Research partially supported by NSERC (Canada) and by the Peter Wall Institute of Advanced Studies (UBC).
Research partially supported by NSERC (Canada).
Rights and permissions
About this article
Cite this article
Barlow, M.T., Masson, R. Spectral Dimension and Random Walks on the Two Dimensional Uniform Spanning Tree. Commun. Math. Phys. 305, 23–57 (2011). https://doi.org/10.1007/s00220-011-1251-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00220-011-1251-8