Entropy reduction in Euclidean first-passage percolation

From MaRDI portal
Publication:728438

DOI10.1214/16-EJP12zbMATH Open1354.60116arXiv1605.06665OpenAlexW2963240142MaRDI QIDQ728438FDOQ728438

Xuan Wang, Michael Damron

Publication date: 20 December 2016

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Abstract: The Euclidean first-passage percolation (FPP) model of Howard and Newman is a rotationally invariant model of FPP which is built on a graph whose vertices are the points of homogeneous Poisson point process. It was shown that one has (stretched) exponential concentration of the passage time Tn from 0 to nmathbfe1 about its mean on scale sqrtn, and this was used to show the bound munleqmathbbETnleqmun+Csqrtn(logn)a for a,C>0 on the discrepancy between the expected passage time and its deterministic approximation mu=limnfracmathbbETnn. In this paper, we introduce an inductive entropy reduction technique that gives the stronger upper bound mathbbETnleqmun+Ckpsi(n)log(k)n, where psi(n) is a general scale of concentration and log(k) is the k-th iterate of log. This gives evidence that the inequality mathbbETnmunleqCsqrtmathrmVarTn may hold.


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






Cited In (7)






This page was built for publication: Entropy reduction in Euclidean first-passage percolation

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