Scaling of loop-erased walks in 2 to 4 dimensions
arXiv:0905.3440 · doi:10.1007/s10955-009-9787-0
Abstract
We simulate loop-erased random walks on simple (hyper-)cubic lattices of dimensions 2,3, and 4. These simulations were mainly motivated to test recent two loop renormalization group predictions for logarithmic corrections in , simulations in lower dimensions were done for completeness and in order to test the algorithm. In , we verify with high precision the prediction , where the number of steps after erasure scales with the number of steps before erasure as . In we again find a power law, but with an exponent different from the one found in the most precise previous simulations: . Finally, we see clear deviations from the naive scaling in . While they agree only qualitatively with the leading logarithmic corrections predicted by several authors, their agreement with the two-loop prediction is nearly perfect.
3 pages, including 3 figures
References in corpus (4)
Cited by in corpus (8)
- Fractal dimensions of self-avoiding walks and Ising high-temperature graphs in 3D conformal bootstrap
- Field Theories for Loop-Erased Random Walks
- The dimension of loop-erased random walk in 3D
- Depinning transition of charge-density waves: mapping onto symmetric theory with and loop-erased random walks
- Physical networks as network-of-networks
- Loop erased random walk on percolation cluster: Crossover from Euclidean to fractal geometry
- Biased and greedy random walks on two-dimensional lattices with quenched randomness: the "greedy" ant within a disordered environment
- Theory and Experiments for Disordered Elastic Manifolds, Depinning, Avalanches, and Sandpiles