Related papers: Record statistics for random walks and L\'evy flig…
In the context of countable groups of polynomial volume growth, we consider a large class of random walks that are allowed to take long jumps along multiple subgroups according to power law distributions. For such a random walk, we study…
We analyze a one-dimensional intermittent random walk on an unbounded domain in the presence of stochastic resetting. In this process, the walker alternates between local intensive search, diffusion, and rapid ballistic relocations in which…
We study a simple one dimensional sluggish random walk model with subdiffusive growth. In the continuum hydrodynamic limit, the model corresponds to a particle diffusing on a line with a space dependent diffusion constant D(x)=…
A continuous time random walk (CTRW) is a random walk in which both spatial changes represented by jumps and waiting times between the jumps are random. The CTRW is coupled if a jump and its preceding or following waiting time are dependent…
In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…
A random walk on a $N$-dimensional hypercube is a discrete time stochastic process whose state space is the set $\{-1,+1\}^{N}$, which has uniform probability of reaching any neighbour state, and probability zero of reaching a non-neighbour…
We study continuous time random walks (CTRW) with power law distribution of waiting times under resetting which brings the walker back to the origin, with a power-law distribution of times between the resetting events. Two situations are…
Continuous time random walk models with decoupled waiting time density are studied. When the spatial one jump probability density belongs to the Levy distribution type and the total time transition is exponential a generalized…
We demonstrate that continuous time random walks in which successive waiting times are correlated by Gaussian statistics lead to anomalous diffusion with mean squared displacement <r^2(t)>~t^{2/3}. Long-ranged correlations of the waiting…
In this paper, we are interested in the asymptotic behaviour of the sequence of processes $(W_n(s,t))_{s,t\in[0,1]}$ with \begin{equation*} W_n(s,t):=\sum_{k=1}^{\lfloor nt\rfloor}\big(1_{\{\xi_{S_k}\leq s\}}-s\big) \end{equation*} where…
Random walk has wide applications in many fields, such as machine learning, biology, physics, and chemistry. Random walk can be discrete or continuous in time and space. Asymmetric random walk could be described by drift-diffusion equation.…
Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…
We study random walks on the giant component of the Erd\H{o}s-R\'enyi random graph ${\cal G}(n,p)$ where $p=\lambda/n$ for $\lambda>1$ fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently…
Let $X$ be a L\'evy process with regularly varying L\'evy measure $\nu$. We obtain sample-path large deviations for scaled processes $\bar X_n(t) \triangleq X(nt)/n$ and obtain a similar result for random walks. Our results yield detailed…
The range process $R_n$ of a random walk is the collection of sites visited by the random walk up to time $n$. In this work we deal with the question of whether the range process of a random walk or the range process of a cocycle over an…
We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…
We consider a continuous-time random walk model with finite-mean waiting-times and we study the mean first-passage time (MFPT) as estimated by an observer in a reference frame $\mathcal{S}$, that is co-moving with a target, and by an…
Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk algorithm for {\em almost uniform sampling} from a state space $S$ of cardinality $N$: run a symmetric ergodic…
For a generalized step reinforced random walk, starting from the origin, the first step is taken according to the first element of an innovation sequence. Then in subsequent epochs, it recalls a past epoch with probability proportional to a…
We develop a comprehensive framework for analyzing full record statistics, covering record counts $M(t_1), M(t_2), \ldots$, and their corresponding attainment times $T_{M(t_1)}, T_{M(t_2)}, \ldots$, as well as the intervals until the next…