Connective Constants on Cayley Graphs

arXiv1410.2591MaRDI QIDQ6255366FDOQ6255366

Kai-Nan Xiang, Song-Chao-Hao Zhu, He Song

Publication date: 8 October 2014

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

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Enumeration in graph theory (05C30) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

This page was built for publication: Connective Constants on Cayley Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6255366)