Self‐avoiding walk on the hypercube

DOI10.1002/rsa.21117zbMath1522.05453arXiv2108.03682OpenAlexW3189397579MaRDI QIDQ6074881

Gordon Slade

Publication date: 19 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.03682

zbMATH Keywords

hypercubephase transitionlace expansionself-avoiding walk

Mathematics Subject Classification ID

Hypergraphs (05C65) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks on graphs (05C81)

Related Items

Weakly self-avoiding walk on a high-dimensional torus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
• Hypercube percolation
• Self-avoiding walk on the complete graph
• Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube
• Self-avoiding walk in 5 or more dimensions
• Tree graph inequalities and critical behavior in percolation models
• Largest random component of a k-cube
• Self-avoiding walk in five or more dimensions. I: The critical behaviour
• Marriage of exact enumeration and \(1/d\) expansion methods: lattice model of dilute polymers
• The scaling limit of lattice trees in high dimensions
• The broken supersymmetry phase of a self-avoiding random walk
• Progress in high-dimensional percolation and random graphs
• A simple convergence proof for the lace expansion
• Self-avoiding walk on nonunimodular transitive graphs
• Supercritical self-avoiding walks are space-filling
• The lace expansion and its application. École d'Été de Probabilités de Saint-Flour XXXIV -- 2004.
• Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
• Expansion in High Dimension for the Growth Constants of Lattice Trees and Lattice Animals
• Asymptotic analysis of a random walk on a hypercube with many dimensions
• Self-Avoiding Walks and Connective Constants
• Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms
• Random self-avoiding walks on one-dimensional lattices
• Singularity Analysis of Generating Functions
• Borel-type bounds for the self-avoiding walk connective constant
• An improvement of Watson’s theorem on Borel summability
• The Evolution of Random Subgraphs of the Cube
• The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions
• Slightly subcritical hypercube percolation
• The length of self-avoiding walks on the complete graph
• Self-avoiding walk enumeration via the lace expansion
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition
• Self-Avoiding Walks on Hyperbolic Graphs
• Asymptotic expansions inn−1 for percolation critical values on then-Cube and ℤn
• Self-avoiding walks crossing a square
• Self-avoiding walks on finite graphs of large girth