Critical behaviour of self-avoiding walk in five or more dimensions

DOI10.1090/S0273-0979-1991-16085-4zbMath0728.60103OpenAlexW1984160648MaRDI QIDQ3352250

Gordon Slade, Takashi Hara

Publication date: 1991

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0273-0979-1991-16085-4

zbMATH Keywords

Brownian motionself-avoiding walkapplications in polymer chemistry

Mathematics Subject Classification ID

Statistical mechanics of polymers (82D60) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Phase transitions (general) in equilibrium statistical mechanics (82B26) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items

On the probability that self-avoiding walk ends at a given point, Self-avoiding walk is sub-ballistic, Generalized approach to the non-backtracking lace expansion, On the radius of self-repellent fractional Brownian motion, The scaling limit of the weakly self-avoiding walk on a high-dimensional torus, Supercritical self-avoiding walks are space-filling, Self-avoiding walk in five or more dimensions. I: The critical behaviour, Regularity properties and pathologies of position-space renormalization-group transformations: scope and limitations of Gibbsian theory, Tree-based models for random distribution of mass, A new approach to the long-time behavior of self-avoiding random walks

Cites Work

• Unnamed Item
• The infinite self-avoiding walk in high dimensions
• Self-avoiding walk in 5 or more dimensions
• Critical behavior of two-dimensional spin models and charge asymmetry in the Coulomb gas
• The diffusion of self-avoiding random walk in high dimensions
• The scaling limit of self-avoiding random walk in high dimensions
• Self-avoiding walk in five or more dimensions. I: The critical behaviour
• Mean-field critical behaviour for correlation length for percolation in high dimensions
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• Convergence of self-avoiding random walk to Brownian motion in high dimensions
• On the Number of Self-Avoiding Walks. II
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE