Related papers: First passage time for random walks in heterogeneo…
In this paper, we propose and analyze a novel one-dimensional inhomogeneous random walk model that combines spatial decay of transition probabilities with a temporal renewal structure for each excursion. In this model, the probability of…
The first passage probability (FPP), of trafficked intracellular particles reaching a displacement L, in a given time t or inverse velocity S = t/L, can be calculated robustly from measured particle tracks, and gives a measure of particle…
Random walks serve as important tools for studying complex network structures, yet their dynamics in cases where transition probabilities are not static remain under explored and poorly understood. Here we study nonlinear random walks that…
The spectral theory of random walks on networks of arbitrary topology can be readily extended to study random walks and L\'evy flights subject to resetting on these structures. When a discrete-time process is stochastically brought back…
We study analytically and numerically the mean fastest first-passage time (fFPT) to an immobile target for an ensemble of $N$ independent finite-speed random searchers driven by dichotomous noise and described by the telegrapher's equation.…
In this work we propose a novel method to calculate mean first-passage times (MFPTs) for random walks on graphs, based on a dimensionality reduction technique for Markov State Models, known as local-equilibrium (LE). We show that for a…
In this paper, we consider a homogeneous Markov process \xi(t;\omega) on an ultrametric space Q_p, with distribution density f(x,t), x in Q_p, t in R_+, satisfying the ultrametric diffusion equation df(x,t)/dt =-Df(x,t). We construct and…
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…
As a basic dynamic feature on complex networks, the property of random walk has received a lot of attention in recent years. In this paper, we first studied the analytical expression of the mean global first passage time (MGFPT) on the…
We study the first passage times of discrete-time branching random walks in ${\mathbb R}^d$ where $d\geq 1$. Here, the genealogy of the particles follows a supercritical Galton-Watson process. We provide asymptotics of the first passage…
We introduce a heterogeneous continuous time random walk (HCTRW) model as a versatile analytical formalism for studying and modeling diffusion processes in heterogeneous structures, such as porous or disordered media, multiscale or crowded…
We consider a random walk in confined geometry, starting from a site and eventually reaching a target site. We calculate analytically the distribution of the occupation time on a third site, before reaching the target site. The obtained…
A self-repelling random walk of a token on a graph is one in which at each step, the token moves to a neighbor that has been visited least often (with ties broken randomly). The properties of self-repelling random walks have been analyzed…
We consider the first-passage problem for $N$ identical independent particles that are initially released uniformly in a finite domain $\Omega$ and then diffuse toward a reactive area $\Gamma$, which can be part of the outer boundary of…
The first passage time (FPT) problem is studied for superstatistical models assuming that the mesoscopic system dynamics is described by a Fokker-Planck equation. We show that all moments of the random intensive parameter associated to the…
We identify a fundamental phenomenon of heterogeneous one dimensional random walks: the escape (traversal) time is maximized when the heterogeneity in transition probabilities forms a pyramid-like potential barrier. This barrier corresponds…
We investigate the first-passage properties of bursty random walks on a finite one-dimensional interval of length L, in which unit-length steps to the left occur with probability close to one, while steps of length b to the right --…
Nodes can be ranked according to their relative importance within the network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based…
We consider the problem of the first passage time to the origin of a spatially non-homogeneous random walk with a position-dependent drift, known as the Gillis random walk, in the presence of resetting. The walk starts from an initial site…
We consider the so-called frog model with random initial configurations. The dynamics of this model is described as follows: Some particles are randomly assigned on any site of the multidimensional cubic lattice. Initially, only particles…