English

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

Group Theory 2014-08-27 v4 Combinatorics Metric Geometry

Abstract

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

Keywords

Cite

@article{arxiv.1203.5624,
  title  = {On the scaling limit of finite vertex transitive graphs with large diameter},
  author = {Itai Benjamini and Hilary Finucane and Romain Tessera},
  journal= {arXiv preprint arXiv:1203.5624},
  year   = {2014}
}

Comments

Final version, to appear in Combinatorica