The length of self-avoiding walks on the complete graph
arXiv:1906.06126 · doi:10.1088/1742-5468/ab3da3
Abstract
We study the variable-length ensemble of self-avoiding walks on the complete graph. We obtain the leading order asymptotics of the mean and variance of the walk length, as the number of vertices goes to infinity. Central limit theorems for the walk length are also established, in various regimes of fugacity. Particular attention is given to sequences of fugacities that converge to the critical point, and the effect of the rate of convergence of these fugacity sequences on the limiting walk length is studied in detail. Physically, this corresponds to studying the asymptotic walk length on a general class of pseudocritical points.
References in corpus (10)
- Hyperscaling above the upper critical dimension
- Decay of correlations in nearest-neighbor self-avoiding walk, percolation, lattice trees and animals
- Finite-size scaling above the upper critical dimension
- On the role of Fourier modes in finite-size scaling above the upper critical dimension
- Non-vanishing boundary effects and quasi-first order phase transitions in high dimensional Ising models
- Fisher's scaling relation above the upper critical dimension
- Finite size scaling of the 5D Ising model with free boundary conditions
- Random-length Random Walks and Finite-size scaling in high dimensions
- Geometric explanation of anomalous finite-size scaling in high dimensions
- The scaling window of the 5D Ising model with free boundary conditions