Self-Avoiding Walks and Connective Constants

DOI10.1007/978-981-15-0302-3_8zbMath1446.82029arXiv1704.05884OpenAlexW2607779876MaRDI QIDQ3297350

Zhongyang Li, Geoffrey R. Grimmett

Publication date: 3 July 2020

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

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

zbMATH Keywords

Cayley graphcubic graphunimodularityregular graphspeedtransitive graphself-avoiding walkquasi-transitive graphlocality theoremconnective constantFisher transformationgolden meangraph height functionbridge constant

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items

Self-avoiding walks and multiple context-free languages, Self‐avoiding walk on the hypercube, Selected Problems in Probability Theory, Note on locality of volume growth rate of graphs, Weighted self-avoiding walks, Cubic graphs and the golden mean, Self-avoiding walk on nonunimodular transitive graphs, Positive speed self-avoiding walks on graphs with more than one end

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the probability that self-avoiding walk ends at a given point
• Self-avoiding walk is sub-ballistic
• Self-avoiding walks and the Fisher transformation
• Non-coincidence of quenched and annealed connective constants on the supercritical planar percolation cluster
• Three theorems in discrete random geometry
• The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
• The set of connective constants of Cayley graphs contains a Cantor space
• Bounds on connective constants of regular graphs
• Local statistics of realizable vertex models
• Spectral radius of finite and infinite planar graphs and of graphs of bounded genus
• The critical \(Z\)-invariant Ising model via dimers: Locality property
• Is the critical percolation probability local?
• Counting self-avoiding walks on free products of graphs
• Non-amenable Cayley graphs of high girth have \(p_c < p_u\) and mean-field exponents
• Amenable semigroups
• The vertex-transitive TLF-planar graphs
• Isoperimetric inequalities, growth, and the spectrum of graphs
• Some relations between analytic and geometric properties of infinite graphs
• Strict inequality for critical values of Potts models and random-cluster processes
• Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
• Self-avoiding walks and amenability
• Critical temperature of periodic Ising models
• Locality of connective constants
• Recurrence of distributional limits of finite planar graphs
• Potts models and random-cluster processes with many-body interactions
• Self-avoiding walks, the language of science, and Fibonacci numbers
• Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
• Existence of a non-averaging regime for the self-avoiding walk on a high-dimensional infinite percolation cluster
• Cubic graphs and the golden mean
• Logarithmic correction for the susceptibility of the 4-dimensional weakly self-avoiding walk: a renormalisation group analysis
• Locality of percolation for abelian Cayley graphs
• Extendable self-avoiding walks
• Probability on Trees and Networks
• Strict Inequalities for Connective Constants of Transitive Graphs
• Full Banach Mean Values on Countable groups.
• Symmetric Random Walks on Groups
• Random self-avoiding walks on one-dimensional lattices
• Vertex-transitive graphs and vertex-transitive maps
• Percolation
• Self-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices
• Self-avoiding walks and trails on the 3.12² lattice
• Improved lower bounds on the connective constants for two-dimensional self-avoiding walks
• Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
• Random Walks on Infinite Graphs and Groups
• On non-uniqueness of percolation on nonamenable Cayley graphs
• A Remark About the Spectral Radius
• Connective constants and height functions for Cayley graphs
• The Random-Cluster Model
• Lectures on Self-Avoiding Walks
• Self-Avoiding Walks on Hyperbolic Graphs
• On the Number of Self-Avoiding Walks
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE
• Multiplicity of phase transitions and mean-field criticality on highly non-amenable graphs.
• A conjecture concerning a limit of non-Cayley graphs