Extendable self-avoiding walks

DOI10.4171/AIHPD/3zbMath1285.05163arXiv1307.7132MaRDI QIDQ2444870

Alexander E. Holroyd, Geoffrey R. Grimmett, Yuval Peres

Publication date: 11 April 2014

Published in: Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) (Search for Journal in Brave)

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

zbMATH Keywords

growthtransitive graphself-avoiding walkquasi-transitive graphbranching numberconnective constantunimodular graph

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Enumeration in graph theory (05C30) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Random walks on graphs (05C81)

Related Items

Connective constants and height functions for Cayley graphs, Self-avoiding walks and amenability, An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension, Self-Avoiding Walks and Connective Constants, Monopoles, dipoles, and harmonic functions on Bratteli diagrams, Bounds on connective constants of regular graphs, Self-avoiding walk on nonunimodular transitive graphs

Cites Work

• Unnamed Item
• Bounds on connective constants of regular graphs
• Random walks and percolation on trees
• Infinite paths that contain only shortest paths
• Self-avoiding walk in five or more dimensions. I: The critical behaviour
• Group-invariant percolation on graphs
• Probability on Trees and Networks
• Endless self-avoiding walks
• Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximation
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE