Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1203.5624 v4 pith:DGWS2CBX submitted 2012-03-26 math.GR math.COmath.MG

classification math.GRmath.COmath.MG
keywords transitiveconvergesdeltadiamdiameterfinitegraphsgromov
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools