Weakly self-avoiding walk on a high-dimensional torus
arXiv:2107.14170 · doi:10.2140/pmp.2023.4.331
Abstract
How long does a self-avoiding walk on a discrete -dimensional torus have to be before it begins to behave differently from a self-avoiding walk on ? We consider a version of this question for weakly self-avoiding walk on a torus in dimensions . On for , the partition function for -step weakly self-avoiding walk is known to be asymptotically purely exponential, of the form , where is the growth constant for weakly self-avoiding walk on . We prove the identical asymptotic behaviour on the torus (with the same and as on ) until reaches order , where is the number of vertices in the torus. This shows that the walk must have length of order at least before it "feels" the torus in its leading asymptotics. Our results support the conjecture that the behaviour of the partition function does change once reaches , and we relate this to a conjectural critical scaling window which separates the dilute phase from the dense phase . To prove the conjecture and to establish the existence of the scaling window remains a challenging open problem. The proof uses a novel lace expansion analysis based on the "plateau" for the torus two-point function obtained in previous work.
arXiv comment43 pages, minor editorial improvements throughout the paper
References in corpus (14)
- Random subgraphs of finite graphs: I. The scaling window under the triangle condition
- Decay of correlations in nearest-neighbor self-avoiding walk, percolation, lattice trees and animals
- Logarithmic correction for the susceptibility of the 4-dimensional weakly self-avoiding walk: a renormalisation group analysis
- Self-avoiding walk is sub-ballistic
- Finite-size scaling above the upper critical dimension
- Scale-free Monte Carlo method for calculating the critical exponent of self-avoiding walks
- Random graph asymptotics on high-dimensional tori. II. Volume, diameter and mixing time
- Random-length Random Walks and Finite-size scaling in high dimensions
- Self-avoiding walks crossing a square
- The scaling window of the 5D Ising model with free boundary conditions
- The length of self-avoiding walks on the complete graph
- Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion
- Unwrapped two-point functions on high-dimensional tori
- Self-avoiding walks and polygons crossing a domain on the square and hexagonal lattices