English

Large deviation principle at speed $n$ for the random metric in first-passage percolation

Probability 2024-12-05 v1

Abstract

Consider standard first-passage percolation on Zd\mathbb Z^d. We study the lower-tail large deviations of the rescaled random metric T^n\widehat{\mathbf T}_n restricted to a box. If all exponential moments are finite, we prove that T^n\widehat{\mathbf T}_n follows the large deviation principle at speed nn with a rate function JJ, in a suitable space of metrics. Moreover, we give three expressions for J(D)J(D). The first two involve the metric derivative with respect to DD of Lipschitz paths and the lower-tail rate function for the point-point passage time. The third is an integral against the 11-dimensional Hausdorff measure of a local cost. Under a much weaker moment assumption, we give an estimate for the probability of events of the type {T^nD}\{\widehat{\mathbf T}_n \le D \}.

Keywords

Cite

@article{arxiv.2412.03320,
  title  = {Large deviation principle at speed $n$ for the random metric in first-passage percolation},
  author = {Julien Verges},
  journal= {arXiv preprint arXiv:2412.03320},
  year   = {2024}
}