Related papers: On the Time Constant in a Dependent First Passage …
In this paper we study first-passge percolation models on Delaunay triangulations. We show a sufficient condition to ensure that the asymptotic value of the rescaled first-passage time, called the time constant, is strictly positive and…
The fluctuations of the passage time in first passage percolation are of great interest. We show that the non-random fluctuations in planar FPP are at least of order $\log(n)^\alpha$ for any $\alpha<1/2$ under some conditions that are known…
We study first passage percolation (FPP) on a Gromov-hyperbolic group $G$ with boundary $\partial G$ equipped with the Patterson-Sullivan measure $\nu$. We associate an i.i.d.\ collection of random passage times to each edge of a Cayley…
We introduce a new first passage percolation model in a Poissonian environment on $\mathbb{R}^{2}$. In this model, the action of a path depends on the geometry of the path and the travel time. We prove that the transversal fluctuation…
First passage percolation with recovery is a process aimed at modeling the spread of epidemics. On a graph $G$ place a red particle at a reference vertex $o$ and colorless particles (seeds) at all other vertices. The red particle starts…
Consider the first passage percolation model on ${\bf Z}^d$ for $d\geq 2$. In this model we assign independently to each edge the value zero with probability $p$ and the value one with probability $1-p$. We denote by $T({\bf 0}, v)$ the…
We consider the model of i.i.d. first passage percolation on Z^d, where we associate with the edges of the graph a family of i.i.d. random variables with common distribution G on [0, +$\infty$] (including +$\infty$). Whereas the time…
We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…
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…
We study the site version of (independent) first-passage percolation on 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 $a_{0,n}$…
The non-random fluctuation is one of the central objects in first passage percolation. It was proved in [Shuta Nakajima. Divergence of non-random fluctuation in First Passage Percolation. {\em Electron. Commun. Probab.} 24 (65), 1-13.…
We study the shape fluctuation in the first passage percolation on $\mathbb{Z}^d$. It is known that it diverges when the distribution obeys Bernoulli in [Yu Zhang. The divergence of fluctuations for shape in first passage percolation.…
We study a geometric version of first-passage percolation on the complete graph, known as long-range first-passage percolation. Here, the vertices of the complete graph $\mathcal K_n$ are embedded in the $d$-dimensional torus $\mathbb…
We consider the first passage percolation model on the square lattice. In this model, $\{t(e): e{an edge of}{\bf Z}^2 \}$ is an independent identically distributed family with a common distribution $F$. We denote by $T({\bf 0}, v)$ the…
We consider first-passage percolation on the $d$ dimensional cubic lattice for $d \geq 2$; that is, we assign independently to each edge $e$ a nonnegative random weight $t_e$ with a common distribution and consider the induced random graph…
The aim of this paper is to generalize the well-known asymptotic shape result for first-passage percolation on $\Zd$ to first-passage percolation on a random environment given by the infinite cluster of a supercritical Bernoulli percolation…
We consider the first passage percolation model on the ${\bf Z}^d$ lattice. In this model, we assign independently to each edge $e$ a non-negative passage time $t(e)$ with a common distribution $F$. Let $a_{0,n}$ be the passage time from…
Consider first passage percolation on $\mathbb{Z}^d$ with passage times given by i.i.d. random variables with common distribution $F$. Let $t_\pi(u,v)$ be the time from $u$ to $v$ for a path $\pi$ and $t(u,v)$ the minimal time among all…
In first-passage percolation on the integer lattice, the Shape Theorem provides precise conditions for convergence of the set of sites reachable within a given time from the origin, once rescaled, to a compact and convex limiting shape.…
We determine the asymptotic speed of the first-passage percolation process on some ladder-like graphs (or width-2 stretches) when the times associated with different edges are independent and exponentially distributed but not necessarily…