On the scaling limit of finite vertex transitive graphs with large diameter
Abstract
Let (Xn) be an unbounded sequence of finite, connected, vertex transitive graphs such that |Xn | = o(diam(Xn)q) for some q>0. We show that up to taking a subsequence, and after rescaling by the diameter, the sequence (Xn) converges in the Gromov Hausdorff distance to a torus of dimension <q, equipped with some invariant Finsler metric. The proof relies on a recent quantitative version of Gromov's theorem on groups with polynomial growth obtained by Breuillard, Green and Tao. If Xn is only roughly transitive and |Xn| = o(diam(Xn)δ) for δ > 1 sufficiently small, we prove, this time by elementary means, that (Xn) converges to a circle.
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.