Connective constants and height functions for Cayley graphs

DOI10.1090/tran/7166zbMath1362.05059arXiv1501.00476OpenAlexW2964311887MaRDI QIDQ5347287

Zhongyang Li, Geoffrey R. Grimmett

Publication date: 23 May 2017

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

Cayley graphharmonic functionunimodularitysolvable groupvertex-transitive graphself-avoiding walkquasi-transitive graphconnective constantbridge decompositiongraph height functiongroup height functionindicabilityhigman group

Mathematics Subject Classification ID

Geometric group theory (20F65) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (10)

Self-avoiding walks and amenability ⋮ Weighted self-avoiding walks ⋮ Locally infinite graphs and symmetries ⋮ Self-Avoiding Walks and Connective Constants ⋮ The 1-2 model ⋮ A general bridge theorem for self-avoiding walks ⋮ Cubic graphs and the golden mean ⋮ Self-avoiding walk on nonunimodular transitive 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterisations of algebraic properties of groups in terms of harmonic functions
• Harmonic maps on amenable groups and a diffusive lower bound for random walks
• Random walks on disordered media and their scaling limits. École d'Été de Probabilités de Saint-Flour XL -- 2010
• Self-avoiding walks and the Fisher transformation
• Bounds on connective constants of regular graphs
• A finitary version of Gromov's polynomial growth theorem.
• Is the critical percolation probability local?
• Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
• Automorphism groups of graphs as topological groups
• Group-invariant percolation on graphs
• Self-avoiding walks and amenability
• Locality of connective constants
• Minimal growth harmonic functions on lamplighter groups
• Locality of percolation for abelian Cayley graphs
• Extendable self-avoiding walks
• Probability on Trees and Networks
• Strict Inequalities for Connective Constants of Transitive Graphs
• The supercritical phase of percolation is well behaved
• A new proof of Gromov’s theorem on groups of polynomial growth
• On non-uniqueness of percolation on nonamenable Cayley graphs
• Lectures on Self-Avoiding Walks
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE
• A Finitely Generated Infinite Simple Group

This page was built for publication: Connective constants and height functions for Cayley graphs