Related papers: First-passage percolation on ladder-like graphs wi…
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 study a version of first passage percolation on $\mathbb{Z}^d$ where the random passage times on the edges are replaced by contact times represented by random closed sets on $\mathbb{R}$. Similarly to the contact process without…
This paper investigates the position (state) distribution of the single step binomial (multi-nomial) process on a discrete state / time grid under the assumption that the velocity process rather than the state process is Markovian. In this…
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…
One model of real-life spreading processes is First Passage Percolation (also called SI model) on random graphs. Social interactions often follow bursty patterns, which are usually modelled with i.i.d.~heavy-tailed passage times on edges.…
In this paper we study a version of (non-Markovian) first passage percolation on graphs, where the transmission time between two connected vertices is non-iid, but increases by a penalty factor polynomial in their expected degrees. Based on…
We consider a model of long-range first-passage percolation on the $d$ dimensional square lattice $Z^d$ in which any two distinct vertices $x, y \in Z^d$ are connected by an edge having exponentially distributed passage time with mean…
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 present rigorous results for the mean first passage time and first passage time statistics for two-channel Markov additive diffusion in a 3-dimensional spherical domain. Inspired by biophysical examples we assume that the particle can…
Large continuous-time Markov chains with exponentially small transition rates arise in modeling complex systems in physics, chemistry and biology. We propose a constructive graph-algorithmic approach to determine the sequence of critical…
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)$)…
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…
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…
We consider the first passage percolation model on the square lattice with an edge weight distribution F. In this paper, we consider the number of optimal paths for two points separated by a long distance. We show that there is a phase…
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…
The Inverse First Passage time problem seeks to determine the boundary corresponding to a given stochastic process and a fixed first passage time distribution. Here, we determine the numerical solution of this problem in the case of a two…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
We uncover a duality between relaxation and first passage processes in ergodic reversible Markovian dynamics in both discrete and continuous state-space. The duality exists in the form of a spectral interlacing -- the respective time scales…
We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…
The aim of this paper is to investigate how the correlation properties of a stationary Markovian stochastic processes affect the First Passage Time distribution. First Passage Time issues are a classical topic in stochastic processes…