Related papers: First-passage percolation on Cartesian power graph…
For $a>0$ and $b \geq 0$, let $\mathbb{G}_{a,b}$ be the subgraph of $\mathbb{Z}^2$ induced by the vertices between the first coordinate axis and the graph of the function $f = f_{a,b}(u) = a \log (1+u) + b \log(1+\log(1+u))$, $u \geq 0$. It…
In this paper we consider first passage percolation on the square lattice \(\mathbb{Z}^d\) with passage times that are independent and have bounded \(p^{th}\) moment for some \(p > 6(1+d),\) but not necessarily identically distributed. For…
We study the critical case of first-passage percolation in two dimensions. Letting $(t_e)$ be i.i.d. nonnegative weights assigned to the edges of $\mathbb{Z}^2$ with $\mathbb{P}(t_e=0)=1/2$, consider the induced pseudometric (passage time)…
We consider the first-passage percolation problem on effectively one-dimensional graphs with vertex set {1,...,n}\times{0,1} and translation-invariant edge-structure. For three of six non-trivial cases we obtain exact expressions for the…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
We study first passage percolation on the configuration model. Assuming that each edge has an independent exponentially distributed edge weight, we derive explicit distributional asymptotics for the minimum weight between two randomly…
Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges. An open question attributed to Furstenberg is whether there exists a two-sided infinite geodesic in first passage…
In this paper, we study the maximal edge-traversal time (simply we call maximal weight hereafter) on the optimal paths in the first passage percolation for several edge distributions, including the Pareto and Weibull distributions. It is…
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…
We consider first-passage percolation with positive, stationary-ergodic weights on the square lattice $\mathbb{Z}^d$. Let $T(x)$ be the first-passage time from the origin to a point $x$ in $\mathbb{Z}^d$. The convergence of the scaled…
We study the mean time for a random walk to traverse between two arbitrary sites of the Erdos-Renyi random graph. We develop an effective medium approximation that predicts that the mean first-passage time between pairs of nodes, as well as…
We consider the model of i.i.d. first passage percolation on $\mathbb{Z}^d$ : we associate with each edge $e$ of the graph a passage time $t(e)$ taking values in $[0,+\infty]$, such that $\mathbb{P}[t(e)<+\infty] >p_c(d)$. Equivalently, we…
We study the time constant $\mu(e_{1})$ in first passage percolation on $\mathbb Z^{d}$ as a function of the dimension. We prove that if the passage times have finite mean, $$\lim_{d \to \infty} \frac{\mu(e_{1}) d}{\log d} = \frac{1}{2a},$$…
First passage percolation on $\mathbb{Z}^2$ is a model for describing the spread of an infection on the sites of the square lattice. The infection is spread via nearest neighbor sites and the time dynamic is specified by random passage…
One model of real-life spreading processes is First Passage Percolation (also called SI model) on random graphs. Social interactions often follow bursty patterns, which are usually modelled with i.i.d.~heavy-tailed passage times on edges.…
We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [6]. We describe our results…
We study the complete graph equipped with a topology induced by independent and identically distributed edge weights. The focus of our analysis is on the weight W_n and the number of edges H_n of the minimal weight path between two distinct…
In this paper we consider first passage percolation on the square lattice \(\mathbb{Z}^d\) with edge passage times that are independent and have uniformly bounded second moment, but not necessarily identically distributed. For integer \(n…
Consider (independent) first-passage percolation on the sites of the triangular lattice $\mathbb{T}$. Denote the passage time of the site $v$ in $\mathbb{T}$ by $t(v)$, and assume that $P(t(v)=0)=P(t(v)=1)=1/2$. Denote by $b_{0,n}$ the…
We consider the standard model of i.i.d. first passage percolation on Z^d given a distribution G on [0, +$\infty$] (including +$\infty$). We suppose that G({0}) > 1 -- p\_c(d), i.e., the edges of positive passage time are in the subcritical…