{"paper":{"title":"Entropy reduction in Euclidean first-passage percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Michael Damron, Xuan Wang","submitted_at":"2016-05-21T16:05:59Z","abstract_excerpt":"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 $T_n$ from $0$ to $n\\mathbf{e}_1$ about its mean on scale $\\sqrt{n}$, and this was used to show the bound $\\mu n \\leq \\mathbb{E}T_n \\leq \\mu n + C\\sqrt{n} (\\log n)^a$ for $a,C>0$ on the discrepancy between the expected passage time and its deterministic approximation $\\mu = \\lim_n \\frac{\\mathbb{E}T_n}{n}$. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06665","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}