Bounds on connective constants of regular graphs
From MaRDI portal
Publication:520036
DOI10.1007/s00493-014-3044-0zbMath1374.05123arXiv1210.6277OpenAlexW2010533447MaRDI QIDQ520036
Zhongyang Li, Geoffrey R. Grimmett
Publication date: 31 March 2017
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.6277
Enumeration in graph theory (05C30) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items
Connective constants and height functions for Cayley graphs, Self-avoiding walks and amenability, Self-avoiding walks and the Fisher transformation, Analyticity Results in Bernoulli Percolation, Erratum: three theorems in discrete random geometry, Extendable self-avoiding walks, Self-Avoiding Walks and Connective Constants, Sum rules for effective resistances in infinite graphs, Existence of a non-averaging regime for the self-avoiding walk on a high-dimensional infinite percolation cluster, Cubic graphs and the golden mean, Self-avoiding walk on nonunimodular transitive graphs, Counting self-avoiding walks on free products of graphs, Locality of connective constants, Positive speed self-avoiding walks on graphs with more than one end
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-avoiding walks and the Fisher transformation
- Non-coincidence of quenched and annealed connective constants on the supercritical planar percolation cluster
- The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
- Connectivity of infinite graphs having a transitive torsion group action
- A note on Menger's theorem for infinite locally finite graphs
- Extendable self-avoiding walks
- Entropy-driven phase transition in low-temperature antiferromagnetic Potts models
- Strict Inequalities for Connective Constants of Transitive Graphs
- Random self-avoiding walks on one-dimensional lattices
- Percolation
- Improved lower bounds on the connective constants for two-dimensional self-avoiding walks
- Upper and lower bounds for the connective constants of self-avoiding walks on the Archimedean and Laves lattices
- The Random-Cluster Model
- Lectures on Self-Avoiding Walks