Connective constants and height functions for Cayley graphs
Geoffrey R. Grimmett, Zhongyang Li

TL;DR
This paper investigates the existence and properties of height functions on Cayley graphs, establishing conditions for their existence and harmonicity, and applying these results to understand the locality of connective constants in self-avoiding walks.
Contribution
It introduces a necessary and sufficient condition for the existence of group height functions on Cayley graphs and demonstrates their harmonicity and applicability to various classes of groups.
Findings
Existence of harmonic unimodular height functions for many Cayley graphs.
Conditions under which group height functions exist and are harmonic.
Application of height functions to establish locality of connective constants.
Abstract
The connective constant of an infinite transitive graph is the exponential growth rate of the number of self-avoiding walks from a given origin. In earlier work of Grimmett and Li, a locality theorem was proved for connective constants, namely, that the connective constants of two graphs are close in value whenever the graphs agree on a large ball around the origin. A condition of the theorem was that the graphs support so-called 'unimodular graph height functions'. When the graphs are Cayley graphs of infinite, finitely generated groups, there is a special type of unimodular graph height function termed here a 'group height function'. A necessary and sufficient condition for the existence of a group height function is presented, and may be applied in the context of the bridge constant, and of the locality of connective constants for Cayley graphs. Locality may thereby be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
