Related papers: First passage percolation and escape strategies

For both Levy flight and Levy walk search processes we analyse the full distribution of first-passage and first-hitting (or first-arrival) times. These are, respectively, the times when the particle moves across a point at some given…

We study geodesics in the Brochette first-passage percolation model, where edges on the same axis-parallel line share a common random passage time, inducing long-range dependence. We focus on the maximal transversal deviation H n of…

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

Let $\{\eta(v): v\in V_N\}$ be a discrete Gaussian free field in a two-dimensional box $V_N$ of side length $N$ with Dirichlet boundary conditions. We study the Liouville first passage percolation, i.e., the shortest path metric where each…

We consider standard first-passage percolation on $\Z^d$. Let $e_1$ be the first coordinate vector. Let $a(n)$ be the expected passage time from the origin to $ne_1$. In this short paper, we note that $a(n)$ is increasing under some strong…

We give an elementary proof that Talagrand's sub-Gaussian concentration inequality implies a limit shape theorem for first passage percolation on any Cayley graph of Z^d, with a bound on the speed of convergence that slightly improves…

Let $E$ be the set of edges of the $d$-dimensional cubic lattice $\mathbb{Z}^d$, with $d\geq2$, and let $t(e),e\in E$, be nonnegative values. The passage time from a vertex $v$ to a vertex $w$ is defined as $\inf_{\pi:v\rightarrow…

We study non-random fluctuation in the first passage percolation on $\mathbb{Z}^d$ and show that it diverges for any dimension. We also prove the divergence of the non-random shape fluctuation, which was conjectured in [Yu Zhang. The…

The first passage time for a single diffusing particle has been studied extensively, but the first passage time of a system of many diffusing particles, as is often the case in physical systems, has received little attention until recently.…

We celebrate the 50th anniversary of one the most classical models in probability theory. In this survey, we describe the main results of first passage percolation, paying special attention to the recent burst of advances of the past 5…

We investigate the first passage time t_{j,N} to a given chemical or Euclidean distance of the first j of a set of N>>1 independent random walkers all initially placed on a site of a disordered medium. To solve this order-statistics problem…

For First Passage Percolation in Z^d with large d, we construct a path connecting the origin to {x_1 =1}, whose passage time has optimal order \log d/d. Besides, an improved lower bound for the "diagonal" speed of the cluster combined with…

This article studies several properties of the half-space last passage percolation, in particular the two-time covariance. We show that, when the two end-points are at small macroscopic distance, then the first order correction to the…

We introduce and study a class of abstract continuous action minimization problems that generalize continuous first and last passage percolation. In this class of models a limit shape exists. Our main result provides a framework under which…

We consider the first passage percolation model on $\mathbf{Z}^2$. In this model, we assign independently to each edge $e$ a passage time $t(e)$ with a common distribution $F$. Let $T(u,v)$ be the passage time from $u$ to $v$. In this…

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…

First-passage percolation is the study of the metric space $(\mathbb{Z}^d,T)$, where $T$ is a random metric defined as the weighted graph metric using random edge-weights $(t_e)_{e\in \mathcal{E}^d}$ assigned to the nearest-neighbor edges…

Solving optimization problems leads to elegant and practical solutions in a wide variety of real-world applications. In many of those real-world applications, some of the information required to specify the relevant optimization problem is…

We consider first passage times $\tau_u = \inf\{n:\; Y_n>u\}$ for the perpetuity sequence $$ Y_n = B_1 + A_1 B_2 + \cdots + (A_1\ldots A_{n-1})B_n, $$ where $(A_n,B_n)$ are i.i.d. random variables with values in ${\mathbb R} ^+\times…

The presence of temporal correlations in random movement trajectories is a widespread phenomenon across biological, chemical and physical systems. The ubiquity of persistent and anti-persistent motion in many natural and synthetic systems…