arXiv Analytics

Sign in

arXiv:1203.5624 [math.GR]AbstractReferencesReviewsResources

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

Itai Benjamini, Hilary Finucane, Romain Tessera

Published 2012-03-26, updated 2014-08-26Version 4

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.

Comments: Final version, to appear in Combinatorica
Categories: math.GR, math.CO, math.MG
Related articles:
arXiv:1711.08295 [math.GR] (Published 2017-11-22)
Scaling limits of Cayley graphs with polynomially growing balls
arXiv:1112.1970 [math.GR] (Published 2011-12-08)
On Small Separations in Cayley Graphs
arXiv:1512.01369 [math.GR] (Published 2015-12-04)
Lectures on approximate groups and Hilbert's 5th problem