Related papers: First-passage percolation on ladder-like graphs wi…
Given a set of snapshots from a temporal network we develop, analyze, and experimentally validate a so-called network interpolation scheme. Our method allows us to build a plausible, albeit random, sequence of graphs that transition between…
We consider a general class of maps of the interval having Lyapunov subexponential instability $|\delta x_{t}|\sim|\delta x_{0}|\exp[\Lambda_{t}(x_{0})\zeta(t)]$, where $\zeta(t)$ grows sublinearly as $t\rightarrow\infty$. We outline here a…
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)…
Probability generating functions for first passage times of Markov chains are found using the method of collective marks. A system of equations is found which can be used to obtain moments of the first passage times.
New theorems for the moments of the first passage time of one dimensional nonlinear stochastic processes with an entrance boundary are formulated. This important class of one dimensional stochastic processes results among others from…
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…
Finding representative reaction pathways is necessary for understanding mechanisms of molecular processes, but is considered to be extremely challenging. We propose a new method to construct reaction paths based on mean first-passage times.…
Let $G$ be a directed graph on finitely many vertices and edges, and assign a positive weight to each edge on $G$. Fix vertices $u$ and $v$ and consider the set of paths that start at $u$ and end at $v$, self-intersecting in any number of…
A random walk problem with particles on discrete double infinite linear grids is discussed. The model is based on the work of Montroll and others. A probability connected with the problem is given in the form of integrals containing…
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…
In this paper we study percolation on a roughly transitive graph G with polynomial growth and isoperimetric dimension larger than one. For these graphs we are able to prove that p_c < 1, or in other words, that there exists a percolation…
The study of first passage times for diffusing particles reaching target states is foundational in various practical applications, including diffusion-controlled reactions. In this work, we present a bi-scaling theory for the probability…
We investigate the first-passage properties of nearest-neighbor hopping on a finite interval with disordered hopping rates. We develop an approach that relies on the backward equation, in conjunction with probability generating functions,…
First-passage times provide invaluable insight into fundamental properties of stochastic processes. Yet, various forms of gating mask first-passage times and differentiate them from actual detection times. For instance, imperfect conditions…
We calculate the first passage time distribution for diffusion through a cylindrical pore with sticky walls. A particle diffusively explores the interior of the pore through a series of binding and unbinding events with the cylinder wall.…
Let G=(V,E) be an undirected loopless graph with possible parallel edges and s and t be two vertices of G. Assume that vertex s is labelled at the initial time step and that every labelled vertex copies its labelling to neighbouring…
We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process). We consider arbitrary converging Markovian…
Advection and dispersion in highly heterogeneous environments involving interfacial discontinuities in the corresponding drift and dispersion rates are described through disparate examples from the physical and biological sciences. A…
First-passage properties are central to the kinetics of target-search processes. Theoretical approaches so far primarily focused on predicting first-passage statistics for a given process or model. In practice, however, one faces the…
Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds…