Speed of convergence in first passage percolation and geodesicity of the average distance

From MaRDI portal
Publication:1650107

DOI10.1214/16-AIHP810zbMATH Open1390.60357arXiv1410.1701OpenAlexW2963925936WikidataQ129908878 ScholiaQ129908878MaRDI QIDQ1650107FDOQ1650107


Authors: Romain Tessera Edit this on Wikidata


Publication date: 29 June 2018

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Abstract: We give an elementary proof that Talagrand's sub-Gaussian concentration inequality implies a limit shape theorem for first passage percolation on any Cayley graph of Z^d, with a bound on the speed of convergence that slightly improves Alexander's bounds. Our approach, which does not use the subadditive theorem, is based on proving that the average distance is close to being geodesic. Our key observation, of independent interest, is that the problem of estimating the rate of convergence for the average distance is equivalent (in a precise sense) to estimating its "level of geodesicity".


Full work available at URL: https://arxiv.org/abs/1410.1701




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Speed of convergence in first passage percolation and geodesicity of the average distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650107)