Related papers: Critical first-passage percolation starting on the…

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 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}$…

We consider first-passage percolation on $\mathbb{Z}^2$ with i.i.d. weights, whose distribution function satisfies $F(0) = p_c = 1/2$. This is sometimes known as the "critical case" because large clusters of zero-weight edges force passage…

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 consider first-passage percolation on the edges of $\mathbb{Z}^2 \times k,$ namely the slab of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $1-p_c(\mathbb{S}_k)$) or 1 ((with probability…

We consider first-passage percolation on the edges of $\mathbb{Z}^2 \times \{1, \cdots, k\},$ namely the slab $\mathbb{S}_k$ of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $p_c(\mathbb{S}_k)$)…

We consider first-passage percolation on the class of "high-dimensional" graphs that can be written as an iterated Cartesian product $G\square G \square \dots \square G$ of some base graph $G$ as the number of factors tends to infinity. We…

The $n$-dimensional binary hypercube is the graph whose vertices are the binary $n$-tuples $\{0, 1\}^n$ and where two vertices are connected by an edge if they differ at exactly one coordinate. We prove that if the edges are assigned…

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…

We show that crossing probabilities in 2D critical site percolation on the triangular lattice in a piecewise analytic Jordan domain converge with power law rate in the mesh size to their limit given by the Cardy-Smirnov formula. We use this…

Let $0<a<b<\infty$ be fixed scalars. Assign independently to each edge in the lattice $\mathbb{Z}^2$ the value $a$ with probability $p$ or the value $b$ with probability $1-p$. For all $u,v\in\mathbb{Z}^2$, let $T(u,v)$ denote the first…

We consider Bernoulli first-passage percolation on the $d$-dimensional hypercubic lattice with $d \geq 2$. The passage time of edge $e$ is $0$ with probability $p$ and $1$ with probability $1-p$, independently of each other. Let $p_c$ be…

We study Bernoulli first-passage percolation (FPP) on the triangular lattice $\mathbb{T}$ in which sites have 0 and 1 passage times with probability $p$ and $1-p$, respectively. Denote by $\mathcal {C}_{\infty}$ the infinite cluster with…

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…

In 1999, Zhang proved that, for first passage percolation on the square lattice $\mathbb{Z}^2$ with i.i.d. non-negative edge weights, if the probability that the passage time distribution of an edge $P(t_e = 0) =1/2 $, the critical value…

We consider the first-passage percolation problem on the random graph with vertex set N\times{0,1}, edges joining vertices at Euclidean distance equal to unity and independent exponential edge weights. We provide a central limit theorem for…

We consider Bernoulli first-passage percolation on the triangular lattice in which sites have 0 and 1 passage times with probability $p$ and $1-p$, respectively. For each $p\in(0,p_c)$, let $\mathcal {B}(p)$ be the limit shape in the…

We study critical percolation on a regular planar lattice. Let $E_G(n)$ be the expected number of open clusters intersecting or hitting the line segment $[0,n]$. (For the subscript $G$ we either take $\mathbb{H}$, when we restrict to the…

We consider first-passage percolation on the two-dimensional integer lattice Z^2 with passage times that are IID exponentials of mean one. It has been conjectured, based on numerical evidence, that the variance of the time T(0,n) to reach…

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…