Related papers: From pseudo-random walk to pseudo-Brownian motion:…
We analyze two models of subdiffusion with stochastic resetting. Each of them consists of two parts: subdiffusion based on the continuous-time random walk (CTRW) scheme and independent resetting events generated uniformly in time according…
In this paper, by using two different techniques we derive an explicit formula for the mean first-passage time (MFPT) between any pair of nodes on a general undirected network, which is expressed in terms of eigenvalues and eigenvectors of…
The motion of self-propelled particles is modeled as a persistent random walk. An analytical framework is developed that allows the derivation of exact expressions for the time evolution of arbitrary moments of the persistent walk's…
We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between a source and a target node of a directed and weighted network. The formula does not require any matrix inversion, and it takes as only…
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…
A particle entering a scattering and absorbing medium executes a random walk through a sequence of scattering events. The particle ultimately achieves first-passage, leaving the medium or it is absorbed. The Kubelka-Munk model describes a…
A second-order random walk on a graph or network is a random walk where transition probabilities depend not only on the present node but also on the previous one. A notable example is the non-backtracking random walk, where the walker is…
We study the simple random walk dynamics on an annealed version of a Small-World Network (SWN) consisting of $N$ nodes. This is done by calculating the mean number of distinct sites visited S(n) and the return probability $P_{00}(t)$ as a…
In this paper we derive weak limits for the discretization errors of sampling barrier-hitting and extreme events of Brownian motion by using the Euler discretization simulation method. Specifically, we consider the Euler discretization…
We investigate the ballistic spreading behavior of the one-dimensional discrete time quantum walks whose time evolution is driven by any balanced quantum coin. We obtain closed-form expressions for the long-time variance of position of…
Let $X_1$, $X_2$, $...$ be a sequence of independently and identically distributed random variables with $\mathsf{E}X_1=0$, and let $S_0=0$ and $S_t=S_{t-1}+X_t$, $t=1,2,...$, be a random walk. Denote $\tau={cases}\inf\{t>1: S_t\leq0\},…
We investigate the escape behavior of systems governed by the one-dimensional nonlinear diffusion equation $\partial_t \rho = \partial_x[\partial_x U\rho] + D\partial^2_x \rho^\nu$, where the potential of the drift, $U(x)$, presents a…
Let $N$ and $M$ be positive integers satisfying $1\le M\le N$, and let $0<p_0<p_1<1$. Define a process $\{X_n\}_{n=0}^\infty$ on $\mathbb{Z}$ as follows. At each step, the process jumps either one step to the right or one step to the left,…
We investigate the mean first passage time of an active Brownian particle in one dimension using numerical simulations. The activity in one dimension is modeled as a two state model; the particle moves with a constant propulsion strength…
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 focus on the existence and its characterization of limit for a certain critical branching random walks in time-space random environment in 1 dimension which was introduced by Birkner et.al. Each particle performs simple random walk on…
In this paper, we consider two skew Brownian motions, driven by the same Brownian motion, with different starting points and different skewness coefficients. We show that we can describe the evolution of the distance between the two…
We consider the $N$-particle noncolliding Bernoulli random walk --- a discrete time Markov process in $\mathbb{Z}^{N}$ obtained from a collection of $N$ independent simple random walks with steps $\in\{0,1\}$ by conditioning that they never…
First-passage properties of continuous stochastic processes confined in a 1--dimensional interval are well described. However, for jump processes (discrete random walks), the characterization of the corresponding observables remains…
Systems where resource availability approaches a critical threshold are common to many engineering and scientific applications and often necessitate the estimation of first passage time statistics of a Brownian motion (Bm) driven by…