Monte Carlo simulations of loop-erased self-avoiding random walks in four and five dimensions were performed, using two distinct algorithms. We find consistency between these methods in their estimates of critical exponents. The upper critical dimension for this phenomenon is four, and it has been s
Self-avoiding random walk in d<4 dimensions
✍ Scribed by V.I. Alkhimov
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 211 KB
- Volume
- 133
- Category
- Article
- ISSN
- 0375-9601
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Consider a set of N cities randomly distributed in the bulk of a hypercube with d dimensions. A walker, with memory m, begins his route from a given city of this map and moves, at each discrete time step, to the nearest point, which has not been visited in the preceding m steps. After reviewing the
## Abstract The first and second correction‐to‐scaling exponents for two‐dimensional self‐avoiding walks have been estimated using exact enumeration data up to twenty‐two steps, and Monte Carlo simulation data from twenty‐three up to two hundred steps. It was found that Δ~1~, the first correction‐t
We show that the number of self-avoiding random walks in the plane can be deduced -in the limit of very long walks -from an integral equation for a function of three variables. This demonstrates the Markovian nature of this problem in two dimensions.