English

Connective Constants on Cayley Graphs

Probability 2014-10-10 v1

Abstract

For a transitive infinite connected graph GG, let μ(G)\mu(G) be its connective constant. Denote by G\mathbf{\cal G} the set of Cayley graphs for finitely generated infinite groups with an infinite-order generator which is independent of other generators. Assume GGG\in\mathbf{\cal G} is a Cayley graph of a finitely presented group, and Cayley graph sequence {Gn}n=1G\{G_n\}_{n=1}^{\infty}\subset \mathbf{\cal G} converges locally to G.G. Then μ(Gn)\mu(G_n) converges to μ(G)\mu(G) as n.n\rightarrow\infty. This confirms partially a conjecture raised by Benjamini [2013. {\it Coarse geometry and randomness.} Lect. Notes Math. {\bf 2100}. Springer.] that connective constant is continuous with respect to local convergence of infinite transitive connected graphs.

Keywords

Cite

@article{arxiv.1410.2591,
  title  = {Connective Constants on Cayley Graphs},
  author = {He Song and Kai-Nan Xiang and Song-Chao-Hao Zhu},
  journal= {arXiv preprint arXiv:1410.2591},
  year   = {2014}
}
R2 v1 2026-06-22T06:18:39.398Z