Strict monotonicity for first passage percolation on graphs of polynomial growth and quasi-trees

MaRDI QIDQ6409189zbMATH OpenFDO

Authors Christian Gorski

Publication date 29 August 2022

Abstract: In 1993 van den Berg and Kesten proved a strict monotonicity theorem for first passage percolation on $mathbb{Z}^d$, $dge2$: given two probability measures $u$ and $ildeu$ with finite mean, if $ildeu$ is strictly more variable than $u$ and $u$ is subcritical in an appropriate sense, the time constant associated to $ildeu$ is strictly smaller than the time constant associated to $u$. In this paper, an analogous result is proven for (not necessarily almost-transitive) graphs of strict polynomial growth and for bounded degree graphs quasi-isometric to trees which satisfy a certain geometric condition we call "admitting detours." It is also proven that if a bounded degree graph does not admit detours, then such a strict monotonicity theorem with respect to variability cannot hold. Large classes of graphs are shown to admit detours, and we conclude that for example any Cayley graph of a virtually nilpotent group which is not isomorphic to the standard Cayley graph of $mathbbZ$ satisfies strict monotonicity with respect to variability, as does any Cayley graph of $Ftimes{F}_k$, $F$ a nontrivial finite group and $F_k$ a free group. Moreover, it is proven that for graphs of strict polynomial growth and bounded degree graphs quasi-isometric to trees, if the weight measure is subcritical in an appropriate sense, then it is "absolutely continuous with respect to the expected empirical measure of the geodesic." This implies a strict monotonicity theorem with respect to stochastic domination of measures, whether or not the graph admits detours.

This page was built for publication: Strict monotonicity for first passage percolation on graphs of polynomial growth and quasi-trees

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