Hostname: page-component-89b8bd64d-5bvrz Total loading time: 0 Render date: 2026-05-10T13:36:54.832Z Has data issue: false hasContentIssue false

Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs

Published online by Cambridge University Press:  12 February 2026

Júlia Komjáthy*
Affiliation:
Delft University of Technology , Netherlands
John Lapinskas
Affiliation:
University of Bristol , United Kingdom; E-mail: john.lapinskas@bristol.ac.uk
Johannes Lengler
Affiliation:
ETH Zurich , Switzerland; E-mail: johannes.lengler@inf.ethz.ch
Ulysse Schaller
Affiliation:
ETH Zurich , Switzerland; E-mail: ulysse.schaller@inf.ethz.ch
*
E-mail: j.komjathy@tudelft.nl (Corresponding author)

Abstract

One-dependent first passage percolation is a spreading process on a graph where the transmission time through each edge depends on the direct surroundings of the edge. In particular, the classical i.i.d. transmission time $L_{xy}$ is multiplied by $(W_xW_y)^\mu $, a polynomial of the expected degrees $W_x, W_y$ of the endpoints of the edge $xy$, which we call the penalty function. Beyond the Markov case, we also allow any distribution for $L_{xy}$ with regularly varying distribution near $0$. We then run this process on three spatial scale-free random graph models: finite and infinite Geometric Inhomogeneous Random Graphs, including Hyperbolic Random Graphs, and Scale-Free Percolation. In these spatial models, the connection probability between two vertices depends on their spatial distance and on their expected degrees.

We show that as the penalty function, that is, $\mu $ increases, the transmission time between two far away vertices sweeps through four universal phases: explosive (with tight transmission times), polylogarithmic, polynomial but strictly sublinear, and linear in the Euclidean distance. The strictly polynomial growth phase is a new phenomenon that so far was extremely rare in spatial graph models. All four growth phases are robust in the model parameters and are not restricted to phase boundaries. Further, the transition points between the phases depend nontrivially on the main model parameters: the tail of the degree distribution, a long-range parameter governing the presence of long edges, and the behaviour of the distribution L near $0$. In this paper we develop new methods to prove the upper bounds in all sub-explosive phases. Our companion paper complements these results by providing matching lower bounds in the polynomial and linear regimes.

Information

Type
Probability
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2026. Published by Cambridge University Press
Figure 0

Table 1 Summary and brief description of the main parameters of the model.

Figure 1

Table 2 Summary of our main results. In 1-FPP, edge transmission times are $L_{xy} (W_xW_y)^\mu $ where $W_x, W_y$ are constant multiples of the expected degrees of the vertices $x,y$, and $L_{xy}$ is i.i.d. with distribution function that varies regularly near $0$ with exponent $\beta \in (0,\infty ]$. The degree distribution follows a power law with exponent $\tau \in (2,3)$: graph distances are doubly logarithmic in the underlying graph. The transmission time $d_{\mathcal {C}}(0,x)$ between $0$ and a far away vertex x sweeps through four different phases as the penalty exponent $\mu $ increases. For long-range parameter $\alpha \in (1,2)$, long edges between low-degree vertices maintain polylogarithmic transmission times (similar to long-range percolation), so increasing $\mu $ stops explosion but it has no further effect. When $\alpha>2$, these edges are sparser and a larger $\mu $ slows down 1-FPP, to polynomial but sublinear transmission times in an interval of length at least $1/d$ for $\mu $. Then, all long edges have polynomial transmission times in the distance they bridge. For even higher penalty exponent $\mu $ the behaviour becomes similar to FPP on the grid $\mathbb {Z}^d$. We give the growth exponents $\Delta _0$ and $\eta _0$ explicitly in (1.9) and (1.10).

Figure 2

Figure 1 Heatmaps for the four different universality classes. The vertices are sorted by their transmission times from the origin (centre vertex). The colours represent this ordering: yellow infected first, then orange, then purple. All four plots are generated on the same underlying graph (with parameters $\tau =2.3$ and $\alpha =5$, and edge connection probabilities $p(u,v)=(w_u w_v / (\mathbb {E}[W]\|u-v\|^2))^5 \wedge 1$), where the vertices are placed on a $750 \times 750$ grid in the 2-dimensional torus. The random factors $L_{xy}$ associated to each edge are also identical in all four plots, and follow an exponential distribution (i.e., $\beta =1$). The only varying parameter is the penalty exponent $\mu $, taking values (i) $\mu =0$ for the explosive regime, (ii) $\mu =0.5$ for the the polylogarithmic regime, (iii) $\mu =1$ for the polynomial regime (iv) $\mu =2$ for the linear regime. In the linear regime, the late points are – typically – high degree vertices carrying high penalisation. We thank Zylan Benjert for generating the simulations and the pictures.

Figure 3

Figure 2 The budget travel plan with 3-edge bridging-paths: (a) first and (b) second iteration.

Figure 4

Table 3 Known results about the universality classes of graph-distances on long-range percolation LRP, scale-free percolation SFP, long-range first-passage percolation LRFPP and infinite geometric inhomogeneous random graphs IGIRG. The results highlighted in yellow color follow (also) from techniques in this paper. $^\ddagger $An upper bound is only known for high enough edge-density or all nearest-neighbour edges present.

Figure 5

Figure 3 Phase diagrams of transmission times in one-dependent first passage percolation. On both diagrams, parameter choices falling in area (a) yield explosive spread. Parameter choices in areas (b) and (c) yield polylogarithmic transmission times $d_{\mathcal C}(0,x)\le (\log \|x\|)^{\Delta _0+o(1)}$, where $\Delta _0=\Delta _\alpha = 1/(1-\log _2\alpha )$ on (b) and $\Delta _0=\Delta _\beta =1/(1-\log _2(\tau -1-\mu \beta ))$ on (c). Parameter choices in areas (d), (e) and (f) yield polynomial transmission times, $d_{\mathcal C}(0,x)= \|x\|^{\eta _0\pm o(1)}$, where $\eta _0=\eta _\beta =d(\mu -(3-\tau )/\beta )$ on (d) $\eta _0=\eta _\alpha =d\mu (\alpha -2)/(\alpha -(\tau -1))$ on (e), and $\eta _0=1$ on (f). The bold lines indicate discontinuous phase transitions, while the other transitions are smooth.

Figure 6

Figure 4 Hyperrectangle-cover and definition of i-good boxes. In this figure, $d=1$, $R=3$, $r_2'/r_1' = 3$, and $r_3'/r_2' = 4$, and the requirement of (B1) for $i> 1$ is ‘all but at most one sub-box $B' \in \mathcal {P}_{i-1}$ of B is good’. The hyperrectangle-cover is denoted by coloured-boundary rectangles. The spatial dimension on the x axis is covered by nested intervals, where (blue) boxes in $\mathcal {P}_2$ contain $3$ level-1 (orange) boxes and (green) boxes in $\mathcal {P}_3$ contain $4$ level-2 boxes. The weight dimension on the y axis is covered by a base-2-cover $I_1,\ldots ,I_6$. Hyperrectangles above $f(r_1)$ (e.g., $B_1\! \times \! I_3$) and above $f(r_2)$ (e.g., $B_2 \!\times \! I_5$), are not included in $\mathcal {P}_1, \mathcal {P}_2$, respectively, since they contain too few vertices for concentration. Good boxes are shaded and bad boxes are hatched or get no colour. Box $B_1$ is good because its two hyper-rectangles $B_1\! \times \! I_1$ and $B_1\! \times \! I_2$ (filled orange) contain the right number of vertices, making all vertices in $B_1 2$-good, including those with weights above $I_1 \cup I_2$. Box $B_1'$ is bad (light hatching), since it contains too few vertices in $B_1\!\times \!I_1$ (cross-hatching). Box $B_2$ is good, because it only contains one bad sub-box ($B_1'$) in $\mathcal {P}_1$, and because its four hyperrectangles $B_2\! \times \! I_1,\ldots ,B_2 \!\times \! I_4$ (filled blue) all contain the right number of $2$-good vertices in total. Since $B_1$ and $B_2$ are both good, vertex v is $3$-good. Box $B_2'$ is ‘doubly’ bad (filled white): it contains two level-$1$ bad sub-boxes, and the hyperrectangle $B_2' \times I_3$ contains too few $1$-good vertices. Thus no vertex in $B_2'$ is $3$-good, including $v'$. Still, $B_3$ is $3$-good: it contains enough $3$-good vertices in total, and only one bad level-$2$ sub-box ($B_2'$).

Figure 7

Figure 5 A schematic representation of a $(\gamma , U, \overline {w}, 2)$-hierarchy of depth $R\!=\!3$. The horizontal axis represents the ($1$-dimensional, Euclidean) distances between the vertices, while the vertical axis shows the level of the hierarchy. The weights of all vertices except $y_0$ and $y_1$ are in the interval $[\overline {w}, 4\overline {w}]$. On level $1$, only the initial vertices $y_0, y_1$ appear and n edges. We ‘push down’ $y_0=y_{00}, y_{1}=y_{11}$ to level $2$ (red) and we find them their respective level-$2$ sibling vertices $y_{01}$ and $y_{10}$ within Euclidean distance $2\xi ^\gamma $, so that there is path of cost at most U between $y_{01}, y_{10}$ (represented by the longest blue arc). Then, we ‘push down’ to level $3$ all vertices that appeared at or before level $2$, that is, $y_{000}, y_{011}, y_{100}, y_{111}$ (red), and find for each of them their level-$3$ siblings, that is, $y_{001}, y_{010}, y_{101}, y_{110}$, so that each vertex is within Euclidean distance $\le 2 \xi ^{\gamma ^2}$ from its level-$3$ sibling, and that there is a path of cost at most U between the newly appearing cousins $y_{001}, y_{010}$ and between $y_{101}, y_{110}$ (represented by the two shrter blue arcs). An intuitive representation is in Figure 2.