Self-avoiding walk in five or more dimensions. I: The critical behaviour

DOI10.1007/BF02099530zbMath0755.60053OpenAlexW1974166834MaRDI QIDQ1200477

Gordon Slade, Takashi Hara

Publication date: 16 January 1993

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02099530

zbMATH Keywords

Fourier transformlace expansionconvergence of the lace expansionself-avoiding walk in the \(d\)-dimensional hypercubic lattice

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Related Items (67)

Polymers in a weak random potential in dimension four: Rigorous renormalization group analysis ⋮ On the probability that self-avoiding walk ends at a given point ⋮ Correct bounds on the Ising lace-expansion coefficients ⋮ Scaling for a random polymer ⋮ Self-avoiding walks and trees in spread-out lattices ⋮ Ballistic behavior in a 1D weakly self-avoiding walk with decaying energy penalty ⋮ Self-avoiding walk is sub-ballistic ⋮ Four-dimensional weakly self-avoiding walk with contact self-attraction ⋮ Generalized approach to the non-backtracking lace expansion ⋮ Self‐avoiding walk on the hypercube ⋮ Selected Problems in Probability Theory ⋮ The near-critical two-point function and the torus plateau for weakly self-avoiding walk in high dimensions ⋮ On self-avoiding polygons and walks: the snake method via polygon joining ⋮ On the radius of self-repellent fractional Brownian motion ⋮ The scaling limit of the weakly self-avoiding walk on a high-dimensional torus ⋮ Weakly self-avoiding walk on a high-dimensional torus ⋮ Long-range self-avoiding walk converges to \(\alpha\)-stable processes ⋮ The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions ⋮ Non-intersection of transient branching random walks ⋮ The lace expansion on a tree with application to networks of self-avoiding walks ⋮ A survey on the lace expansion for the nearest-neighbor models on the BCC lattice ⋮ Critical exponents for long-range \(\mathrm O(n)\) models below the upper critical dimension ⋮ Extendable self-avoiding walks ⋮ Supercritical self-avoiding walks are space-filling ⋮ The scaling limit of loop-erased random walk in three dimensions ⋮ The length of self-avoiding walks on the complete graph ⋮ Self-testing algorithms for self-avoiding walks ⋮ Constructive field theory and applications: Perspectives and open problems ⋮ Lace expansion for the Ising model ⋮ Critical behavior and the limit distribution for long-range oriented percolation. I ⋮ An upper bound on the number of self-avoiding polygons via joining ⋮ The Hammersley-Welsh bound for self-avoiding walk revisited ⋮ Mean-field behavior for long- and finite range Ising model, percolation and self-avoiding walk ⋮ The number and size of branched polymers in high dimensions ⋮ Decay of correlations in nearest-neighbor self-avoiding walk, percolation, lattice trees and animals ⋮ New lower bounds on the self-avoiding-walk connective constant ⋮ Regularity properties and pathologies of position-space renormalization-group transformations: scope and limitations of Gibbsian theory ⋮ Critical behaviour of self-avoiding walk in five or more dimensions ⋮ Monte Carlo study of four-dimensional self-avoiding walks of up to one billion steps ⋮ Self-avoiding walk on nonunimodular transitive graphs ⋮ Efficient implementation of the Pivot algorithm for self-avoiding walks ⋮ Counting self-avoiding walks on free products of graphs ⋮ Harry Kesten's work in probability theory ⋮ Random polymers ⋮ NoBLE for lattice trees and lattice animals ⋮ On self-avoiding polygons and walks: The snake method via pattern fluctuation ⋮ Hyperbolic self avoiding walk ⋮ History and Introduction to Polygon Models and Polyominoes ⋮ Polygons and the Lace Expansion ⋮ Positive speed self-avoiding walks on graphs with more than one end ⋮ Self-avoiding walk, spin systems and renormalization ⋮ Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion ⋮ Loop-erased random walk on a torus in dimensions 4 and above ⋮ Hamiltonian walks on the Sierpinski gasket ⋮ Gaussian limit for critical oriented percolation in high dimensions. ⋮ A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons. ⋮ Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks. ⋮ A note on mean-field behavior for self-avoiding walk on branching planes. ⋮ Logarithmic correction for the susceptibility of the 4-dimensional weakly self-avoiding walk: a renormalisation group analysis ⋮ Scaling properties of a moving polymer ⋮ Conformal invariance predictions for the three-dimensional self-avoiding walk ⋮ Correction-to-scaling exponents for two-dimensional self-avoiding walks ⋮ Loop-weighted walk ⋮ Critical two-point function of the 4-dimensional weakly self-avoiding walk ⋮ On the existence of critical exponents for self-avoiding walks ⋮ Self-avoiding walks ⋮ Critical correlation functions for the 4-dimensional weakly self-avoiding walk and \(n\)-component \(|\varphi|^4\) model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The infinite self-avoiding walk in high dimensions
• The self-avoiding walk.
• Geometric analysis of \(\phi^ 4\) fields and Ising models. I, II
• Mean-field critical behaviour for percolation 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
• End patterns of self-avoiding walks
• A self-avoiding random walk
• Self-avoiding walk on a hierarchical lattice in four dimensions
• The number and size of branched polymers in high dimensions
• Triangle condition for oriented percolation in high dimensions
• 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.
• On the upper critical dimension of lattice trees and lattice animals
• Critical behaviour of self-avoiding walk in five or more dimensions
• Convergence of self-avoiding random walk to Brownian motion in high dimensions
• THE LACE EXPANSION FOR SELF-AVOIDING WALK IN FIVE OR MORE DIMENSIONS
• On the Number of Self-Avoiding Walks. II
• On the Number of Self-Avoiding Walks
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE

This page was built for publication: Self-avoiding walk in five or more dimensions. I: The critical behaviour