Connective Constants on Cayley Graphs
Abstract
For a transitive infinite connected graph G, let μ(G) be its connective constant. Denote by G the set of Cayley graphs for finitely generated infinite groups with an infinite-order generator which is independent of other generators. Assume G∈ G is a Cayley graph of a finitely presented group, and Cayley graph sequence \Gn\n=1∞⊂ G converges locally to G. Then μ(Gn) converges to μ(G) as n→∞. This confirms partially a conjecture raised by Benjamini [2013. Coarse geometry and randomness. Lect. Notes Math. 2100. Springer.] that connective constant is continuous with respect to local convergence of infinite transitive connected graphs.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.