Related papers: The time constant for Bernoulli percolation is Lip…

Let G be a planar graph with polynomial growth and isoperimetric dimension bigger than 1. Then the critical p for Bernoulli percolation on G satisfies p<1.

This paper focuses on the time constant for last passage percolation on complete graph. Let $G_n=([n],E_n)$ be the complete graph on vertex set $[n]=\{1,2,\ldots,n\}$, and i.i.d. sequence $\{X_e:e\in E_n\}$ be the passage times of edges.…

We consider first-passage percolation (FPP) on the triangular lattice with vertex weights $(t_v)$ whose common distribution function $F$ satisfies $F(0)=1/2$. This is known as the critical case of FPP because large (critical) zero-weight…

There exists a Lipschitz embedding of a d-dimensional comb graph (consisting of infinitely many parallel copies of Z^{d-1} joined by a perpendicular copy) into the open set of site percolation on Z^d, whenever the parameter p is close…

We consider first-passage percolation on a ladder, i.e. the graph {0,1,...}*{0,1} where nodes at distance 1 are joined by an edge, and the times are exponentially i.i.d. with mean 1. We find an appropriate Markov chain to calculate an…

Let $G$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. We prove that if $G$ is nonamenable and $p > p_c(G)$ then there exists a positive constant $c_p$ such that \[\mathbf{P}_p(n \leq |K| <…

We investigate a novel first-passage percolation model, referred to as the Brochette first-passage percolation model, where the passage times associated with edges lying on the same line are equal. First, we establish a point-to-point…

We prove Schramm's locality conjecture for Bernoulli bond percolation on transitive graphs: If $(G_n)_{n\geq 1}$ is a sequence of infinite vertex-transitive graphs converging locally to a vertex-transitive graph $G$ and $p_c(G_n) \neq 1$…

We prove that the reconstruction of a certain type of length spaces from their travel time data on a closed subset is Lipschitz stable. The travel time data is the set of distance functions from the entire space, measured on the chosen…

We consider the standard model of i.i.d. bond percolation on $\mathbb Z^d$ of parameter $p$. When $p>p_c$, there exists almost surely a unique infinite cluster $\mathcal C_p$. Using the recent techniques of Cerf and Dembin, we prove that…

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 introduce and study a non-oriented first passage percolation model having a property of statistical invariance by time reversal. This model is defined in a graph having directed edges and the passage times associated with each set of…

Consider the graph induced by $\mathbb{Z}^d$, equipped with uniformly elliptic random conductances. At time $0$, place a Poisson point process of particles on $\mathbb{Z}^d$ and let them perform independent simple random walks. Tessellate…

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 study the problem of coexistence in a two-type competition model governed by first-passage percolation on $\Zd$ or on the infinite cluster in Bernoulli percolation. Actually, we prove for a large class of ergodic stationary passage times…

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 consider a non trivial Boolean model $\Sigma$ on ${\mathbb R}^d$ for $d\geq 2$. For every $x,y \in {\mathbb R}^d$ we define $T(x,y)$ as the minimum time needed to travel from $x$ to $y$ by a traveler that walks at speed $1$ outside…

We consider planar first-passage percolation and show that the time constant can be bounded by multiples of the first and second tertiles of the weight distribution. As a consequence we obtain a counter-example to a problem proposed by Alm…

It is well known that a continuous phase transition in Bernoulli bond percolation on the integer lattice is equivalent to a vanishing probability a vertex is invaded in invasion percolation. We provide a coupling between invasion…

We study inhomogeneous Bernoulli bond percolation on the graph $G \times \mathbb{Z}$, where $G$ is a connected quasi-transitive graph. The inhomogeneity is introduced through a random region $R$ around the origin axis…