Related papers: First Gap Statistics of Long Random Walks with Bou…
We present analytical results for the distribution of first return (FR) times of non-backtracking random walks (NBWs) on undirected configuration model networks consisting of $N$ nodes with degree distribution $P(k)$. We focus on the case…
Consider a random walk on a tree $G=(V,E)$. For $v,w \in V$, let the hitting time $H(v,w)$ denote the expected number of steps required for the random walk started at $v$ to reach $w$, and let $\pi_v = \mathrm{deg}(v)/2|E|$ denote the…
We investigate the large deviation probabilities of first passage times (FPT) of discrete-time supercritical non-lattice branching random walks (BRWs) in $\mathbb{R}^d$ where $d\geq 1$. The FPT refers to the first time the BRW enters a ball…
We consider a class of discrete-time random walks with directed unit steps on the integer line. The direction of the steps is reversed at the time instants of events in a discrete-time renewal process and is maintained at uneventful time…
We study first-passage statistics for one-dimensional random walks $S_n$ with independent and identically distributed jumps starting from the origin. We focus on the joint distribution of the first-passage time $\tau_b$ and first-passage…
We introduce a method to exactly generate bridge trajectories for discrete-time random walks, with arbitrary jump distributions, that are constrained to initially start at the origin and return to the origin after a fixed time. The method…
Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…
We consider a discrete time random walk in one dimension. At each time step the walker jumps by a random distance, independent from step to step, drawn from an arbitrary symmetric density function. We show that the expected positive maximum…
It is the common lore to assume that knowing the equation for the probability distribution function (PDF) of a stochastic model as a function of time tells the whole picture defining all other characteristics of the model. We show that this…
Various graph algorithms have been developed with multiple random walks, the movement of several independent random walkers on a graph. Designing an efficient graph algorithm based on multiple random walks requires investigating multiple…
The interaction between individuals in biological populations, dilute components of chemical systems, or particles transported by turbulent flows depends critically on their contact statistics. This work clarifies those statistics under the…
We review recent advances on the record statistics of strongly correlated time series, whose entries denote the positions of a random walk or a L\'evy flight on a line. After a brief survey of the theory of records for independent and…
A survey is presented of known results concerning simple random walk on the class of distance-regular graphs. One of the highlights is that electric resistance and hitting times between points can be explicitly calculated and given strong…
For a continuous-time catalytic branching random walk (CBRW) on Z, with an arbitrary finite number of catalysts, we study the asymptotic behavior of position of the rightmost particle when time tends to infinity. The mild requirements…
In this paper, we consider a type of continuous time random walk model where the jump length is correlated with the waiting time. The asymptotic behaviors of the coupled jump probability density function in the Fourier-Laplace domain are…
We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…
Since its introduction, some sixty years ago, the Montroll-Weiss continuous time random walk has found numerous applications due its ease of use and ability to describe both regular and anomalous diffusion. Yet, despite its broad…
Building upon the knowledge of the distribution of the first positive position reached by a random walker starting from the origin, one can derive new results on the statistics of the gap between the largest and second-largest positions of…
We study the mixing time of a non-Markovian process, the step-reinforced random walk (SRRW) on a finite group. This process differs from a classical random walk in that at each integer time, with probability $\alpha$ the next step is chosen…
In high-frequency financial data not only returns, but also waiting times between consecutive trades are random variables. Therefore, it is possible to apply continuous-time random walks (CTRWs) as phenomenological models of the…