Loop-Erased Random Walk
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 197-217
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed GraphJournal of Algorithms, 1998
- Generating random spanning trees more quickly than the cover time1996
- Loop-erased self-avoiding walks in two dimensions: exact critical exponents and winding numbersPhysica A: Statistical Mechanics and its Applications, 1992
- Exact fractal dimension of the loop-erased self-avoiding walk in two dimensionsPhysical Review Letters, 1992
- Escape probabilities for slowly recurrent setsProbability Theory and Related Fields, 1992
- Choosing a Spanning Tree for the Integer Lattice UniformlyThe Annals of Probability, 1991
- Nonintersection Exponents for Brownian Paths. II. Estimates and Applications to a Random FractalThe Annals of Probability, 1990
- Critical exponent for the loop erased self-avoiding walk by Monte Carlo methodsJournal of Statistical Physics, 1990
- Hitting probabilities of random walks on ZdStochastic Processes and their Applications, 1987
- A self-avoiding random walkDuke Mathematical Journal, 1980