Connective Constants on Cayley Graphs

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

Publication date 8 October 2014

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)

Abstract: For a transitive infinite connected graph

G

, let

m u (G)

be its connective constant. Denote by

m a t h b f c a l G

the set of Cayley graphs for finitely generated infinite groups with an infinite-order generator which is independent of other generators. Assume

G i n m a t h b f c a l G

is a Cayley graph of a finitely presented group, and Cayley graph sequence

{G_{n}}_{n = 1}^{i n f t y} s u b s e t m a t h b f c a l G

converges locally to

G .

Then

m u (G_{n})

converges to

m u (G)

as

n i g h t a r r o w i n f t y .

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.

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)