pith. sign in

arxiv: 1203.5624 · v4 · pith:DGWS2CBXnew · submitted 2012-03-26 · 🧮 math.GR · math.CO· math.MG

On the scaling limit of finite vertex transitive graphs with large diameter

classification 🧮 math.GR math.COmath.MG
keywords transitiveconvergesdeltadiamdiameterfinitegraphsgromov
0
0 comments X
read the original abstract

Let $(X_n)$ be an unbounded sequence of finite, connected, vertex transitive graphs such that $ |X_n | = o(diam(X_n)^q)$ for some $q>0$. We show that up to taking a subsequence, and after rescaling by the diameter, the sequence $(X_n)$ 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 $X_n$ is only roughly transitive and $|X_n| = o\bigl({diam(X_n)^{\delta}}\bigr)$ for $\delta > 1$ sufficiently small, we prove, this time by elementary means, that $(X_n)$ converges to a circle.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.