Related papers: First-passage percolation with exponential times o…

We obtain an exact formula for the first-passage time probability distribution for random walks on complex networks using inverse Laplace transform. We write the formula as the summation of finitely many terms with different frequencies…

We consider the standard model of first-passage percolation on $\mathbb{Z}^d$ ($d\geq 2$), with i.i.d. passage times associated with either the edges or the vertices of the graph. We focus on the particular case where the distribution of…

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 study the rate of convergence in the Shape Theorem of first-passage percolation, obtaining the precise asymptotic rate of decay for the probability of linear order deviations under a moment condition. Our results are stated for a given…

In this paper we consider first-passage percolation on certain 1-dimensional periodic graphs, such as the $\Z\times\{0,1,\ldots,K-1\}^{d-1}$ nearest neighbour graph for $d,K\geq1$. We find that both length and weight of minimal-weight paths…

There are known expressions to calculate the moments of the first passage time in Markov chains. Nevertheless, it is commonly forgotten that in most applications the parameters of the Markov chain are constructed using estimates based upon…

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…

This article describes an accurate procedure for computing the mean first passage times of a finite irreducible Markov chain and a Markov renewal process. The method is a refinement to the Kohlas, Zeit fur Oper Res, 30,197-207, (1986)…

We consider directed first passage percolation on the integer lattice, with time constant $\mu$ and passage time $a_{0n}$ from the origin to $(n,0,...,0)$. It is shown that under certain conditions on the passage time distribution, $Ea_{0n}…

A general theory is derived for the moments of the first passage time of a one-dimensional Markov process in presence of a weak time-dependent forcing. The linear corrections to the moments can be expressed by quadratures of the potential…

Consider a network embedded in the 2D plane, where a particle diffuses along the edges of the network. It is clear that over short length scales a particle moves along a single edge and thus undergoes one-dimensional diffusion. However, on…

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…

Fluctuations in stochastic systems are usually characterized by the full counting statistics, which analyzes the distribution of the number of events taking place in the fixed time interval. In an alternative approach, the distribution of…

Let $0<a<b<\infty$, and for each edge $e$ of $Z^d$ let $\omega_e=a$ or $\omega_e=b$, each with probability 1/2, independently. This induces a random metric $\dist_\omega$ on the vertices of $Z^d$, called first passage percolation. We prove…

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 define an inhomogeneous percolation model on "ladder graphs" obtained as direct products of an arbitrary graph $G = (V,E)$ and the set of integers $\mathbb{Z}$ (vertices are thought of as having a "vertical" component indexed by an…

In first-passage percolation, one places nonnegative i.i.d. random variables (T (e)) on the edges of Z d. A geodesic is an optimal path for the passage times T (e). Consider a local property of the time environment. We call it a pattern. We…

We consider the directed first passage percolation model on ${\bf Z}^2$. In this model, we assign independently to each edge $e$ a passage time $t(e)$ with a common distribution $F$. We denote by $\vec{T}({\bf 0}, (r,\theta))$ the passage…

We consider a Markov chain on invertible $n\times n$ matrices with entries in $\mathbb{Z}_2$ which moves by picking an ordered pair of distinct rows and add the first one to the other, modulo $2$. We establish a logarithmic Sobolev…

A popular method to compute first-passage probabilities in continuous-time Markov chains is by numerically inverting their Laplace transforms. Past decades, the scientific computing community has developed excellent numerical methods for…