Large deviations in first-passage percolation
A specific probability space and measure are associated with nonnegative independent identically distributed random variables which are attached to normalized edges of a graph in (\(d>2\))-dimensional space. Each sample path between two vertices is an alternating sequence of vertices and edges with fixed end-points. Among various passage times, the face-face and point-point first-passage times are of major interest. The paper focuses on their limiting behaviour when the number of edges grows to infinity. Most limit behaviors in first passage percolation are obtained by using subadditive arguments which do not work in the limit. Technical Theorems 1-3 resolve this difficulty by employing the min-cut and max-flow theorems and setting up a multi-subadditive argument.
scientific article; zbMATH DE number 2063753