Pith. sign in

REVIEW

First passage percolation on nilpotent Cayley graphs and beyond

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 1410.3292 v3 pith:LPSZSZKH submitted 2014-10-13 math.PR

classification math.PR
keywords asymptoticcayleyconesgraphsnilpotentpansupercolationprove
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Our main result is an extension of Pansu's theorem to random metrics, where the edges of the Cayley are i.i.d. random variable with some finite exponential moment. Based on a previous work by the second author, the proof relies on Talagrand's concentration inequality, and on Pansu's theorem. Adapting a well-known argument for Z^d, we prove a sublinear estimate on the variance for virtually nilpotent groups which are not virtually isomorphic to Z. We further discuss the asymptotic cones of first-passage percolation on general infinite connected graphs: we prove that the asymptotic cones are a.e. deterministic if and only the volume growth is subexponential.

Discussion (0). Continue with ORCID to comment.

Pith tools