A Lower Bound on the Growth Exponent for Loop-Erased Random Walk in Two Dimensions

DOI10.1051/ps:1999100zbMath0926.60041arXivmath/9803034OpenAlexW2112422469MaRDI QIDQ4242066

Gregory F. Lawler

Publication date: 15 June 1999

Published in: ESAIM: Probability and Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9803034

zbMATH Keywords

Beurling projection theoremloop-erased walk

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50)

Related Items

Heat kernel for random walk trace on \(\mathbb Z^{3}\) and \(\mathbb Z^{4}\), The asymptotic determinant of the discrete Laplacian

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hitting probabilities of random walks on \({\mathbb{Z}}^ d\)
• Choosing a spanning tree for the integer lattice uniformly
• Tilings and discrete Dirichlet problems
• Percolation dimension of Brownian motion in \(\mathbb{R}^3\)
• The logarithmic correction for loop-erased walk in four dimensions
• Cut times for simple random walk
• The Intersection Exponent for Simple Random Walk
• Rigorous exponent inequalities for random walks
• How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
• A Discrete Analogue of a Theorem of Makarov
• Beurling's projection theorem via one-dimensional Brownian motion