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 . We study the lower-tail large deviations of the rescaled random metric restricted to a box. If all exponential moments are finite, we prove that follows the large deviation principle at speed with a rate function , in a suitable space of metrics. Moreover, we give three expressions for . The first two involve the metric derivative with respect to of Lipschitz paths and the lower-tail rate function for the point-point passage time. The third is an integral against the -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 .
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}
}