A Lower Bound on the Growth Exponent for Loop-Erased Random Walk in Two Dimensions
ESAIM: Probability and Statistics (2010)
- Volume: 3, page 1-21
- ISSN: 1292-8100
Access Full Article
topAbstract
topHow to cite
topLawler, Gregory F.. "A Lower Bound on the Growth Exponent for Loop-Erased Random Walk in Two Dimensions." ESAIM: Probability and Statistics 3 (2010): 1-21. <http://eudml.org/doc/197727>.
@article{Lawler2010,
abstract = {
The growth exponent α for loop-erased or Laplacian random walk
on the integer lattice is defined by saying that the expected time to
reach the sphere of radius n is of order nα. We prove that
in two dimensions, the growth exponent is strictly greater than one.
The proof uses a known estimate on the third moment of the escape
probability and an improvement on the discrete Beurling projection theorem.
},
author = {Lawler, Gregory F.},
journal = {ESAIM: Probability and Statistics},
keywords = {loop-erased walk; Beurling projection theorem},
language = {eng},
month = {3},
pages = {1-21},
publisher = {EDP Sciences},
title = {A Lower Bound on the Growth Exponent for Loop-Erased Random Walk in Two Dimensions},
url = {http://eudml.org/doc/197727},
volume = {3},
year = {2010},
}
TY - JOUR
AU - Lawler, Gregory F.
TI - A Lower Bound on the Growth Exponent for Loop-Erased Random Walk in Two Dimensions
JO - ESAIM: Probability and Statistics
DA - 2010/3//
PB - EDP Sciences
VL - 3
SP - 1
EP - 21
AB -
The growth exponent α for loop-erased or Laplacian random walk
on the integer lattice is defined by saying that the expected time to
reach the sphere of radius n is of order nα. We prove that
in two dimensions, the growth exponent is strictly greater than one.
The proof uses a known estimate on the third moment of the escape
probability and an improvement on the discrete Beurling projection theorem.
LA - eng
KW - loop-erased walk; Beurling projection theorem
UR - http://eudml.org/doc/197727
ER -
References
top- Ahlfors L., Conformal Invariance. Topics in Geometric Function Theory. McGraw-Hill (1973).
- Billingsley P., Probability and Measure. 2nd ed., John Wiley (1986).
- Burdzy K. and Lawler G., Rigorous exponent inequalities for random walks. J. Phys. A.23 (1990) L23-L28.
- Duplantier B., Loop-erased self-avoiding walks in 2D. Physica A191 (1992) 516-522.
- Fargason C., The percolation dimension of Brownian motion in three dimensions. Ph.D. dissertation, Duke University (1998).
- Guttmann A. and Bursill R., Critical exponent for the loop-erased self-avoiding walk by Monte Carlo methods. J. Stat. Phys.59 (1990) 1-9.
- Kenyon R., The asymptotic distribution of the discrete Laplacian (1998) preprint.
- Kesten H., Hitting probabilities of random walks on . Stoc. Proc. Appl.25 (1987) 165-184.
- Lawler G., Intersections of Random Walks. Birkhäuser-Boston (1991).
- Lawler G., A discrete analogue of a theorem of Makarov. Comb. Prob. Computing2 (1993) 181-199.
- Lawler G., The logarithmic correction for loop-erased walk in four dimensions, Proceedings of the Conference in Honor of Jean-Pierre Kahane (Orsay 1993), special issue of J. Fourier Anal. Appl. (1995) 347-362.
- Lawler G., Cut points for simple random walk. Electron. J. Prob.1 (1996) 13.
- Lawler G., Loop-erased random walk, preprint, to appear in volume in honor of Harry Kesten (1998).
- Lawler G. and Puckette E., The intersection exponent for simple random walk (1998) preprint.
- Madras N. and Slade G., The Self-Avoiding Walk. Birkhäuser-Boston (1993).
- Majumdar S.N., Exact fractal dimension of the loop-erased self-avoiding random walk in two dimensions, Phys. Rev. Lett.68 (1992) 2329-2331.
- Pemantle R., Choosing a spanning tree for the integer lattice uniformly. Ann. Prob.19 (1991) 1559-1574.
- Propp J. and Wilson D., How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. J. Algorithms (to appear).
- Pommerenke C., Boundary Behaviour of Conformal Maps, Springer-Verlag (1992).
- Werner W., Beurling's projection theorem via one-dimensional Brownian motion. Math. Proc. Cambridge Phil. Soc.119 (1996) 729-738.
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.