Related papers: Record statistics for random walks and L\'evy flig…
Levy walk (LW) process has been used as a simple model for describing anomalous diffusion in which the mean squared displacement of the walker grows non-linearly with time in contrast to the diffusive motion described by simple random walks…
The Sparre-Andersen theorem is a remarkable result in one-dimensional random walk theory concerning the universality of the ubiquitous first-passage-time distribution. It states that the probability distribution $\rho_n$ of the number of…
For the perimeter length $L_n$ and the area $A_n$ of the convex hull of the first $n$ steps of a planar random walk, this thesis study $n \to \infty$ mean and variance asymptotics and establish distributional limits. The results apply to…
The loop-erased random walk (LERW) in $\mathbb{Z}^4$ is the process obtained by erasing loops chronologically for simple random walk. We prove that the escape probability of the LERW renormalized by $(\log n)^{\frac{1}{3}}$ converges almost…
We review recent studies demonstrating a nonuniversal (continuously variable) survival exponent for history-dependent random walks, and analyze a new example, the hard movable partial reflector. These processes serve as a simplified models…
We revisit the statistics of extremes and records of symmetric random walks with stochastic resetting, extending earlier studies in several directions. We put forward a diffusive scaling regime (symmetric step length distribution with…
A powerful strategy to accelerate quantum-walk-based search algorithms leverages on resetting protocols, where a detector monitors a target site and the evolution of the walker is restarted if no detection occurs within a fixed time…
Given a Gaussian random walk (or a Wiener process), possibly with drift, observed through noise, we consider the problem of estimating its first-passage time $\tau_\ell$ of a given level $\ell$ with a stopping time $\eta$ defined over the…
For a graph $G$ on $n$ vertices, naively sampling the position of a random walk of at time $t$ requires work $\Omega(t)$. We desire local access algorithms supporting $\text{position}(G,s,t)$ queries, which return the position of a random…
We propose a universal framework to compute record age statistics of a stochastic time-series that undergoes random restarts. The proposed framework makes minimal assumptions on the underlying process and is furthermore suited to treat…
The integer points (sites) of the real line are marked by the positions of a standard random walk. We say that the set of marked sites is weakly, moderately or strongly sparse depending on whether the jumps of the standard random walk are…
The recent availability of large databases allows to study macroscopic properties of many complex systems. However, inferring a model from a fit of empirical data without any knowledge of the dynamics might lead to erroneous interpretations…
In this paper, we consider a stochastic process that may experience random reset events which relocate the system to its starting position. We focus our attention on a one-dimensional, monotonic continuous-time random walk with a constant…
We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…
Let $G$ be a connected graph of uniformly bounded degree. A $k$ non-backtracking random walk ($k$-NBRW) $(X_n)_{n =0}^{\infty}$ on $G$ evolves according to the following rule: Given $ (X_n)_{n =0}^{s}$, at time $s+1$ the walk picks at…
We study a variant of the Generalized Excited Random Walk (GERW) on $\mathbb{Z}^d$ introduced by Menshikov, Popov, Ram\'irez and Vachkovskaia in [Ann. Probab. 40 (5), 2012]. It consists of a particular version of the model studied in [arXiv…
We study a continuous time branching process where an individual splits into two daughters with rate b and dies with rate a, starting from a single individual at t=0. We show that the model can be mapped exactly to a random walk problem…
The Rademacher random walk associated with a deterministic sequence $(a_n)_{n \geq 1}$ is the walk which starts at zero and, at step $i$, independently steps either up or down by $a_i$ with equal probability. We continue the study begun by…
The L\'evy walk process with rests is discussed. The jumping time is governed by an $\alpha$-stable distribution with $\alpha>1$ while a waiting time distribution is Poissonian and involves a position-dependent rate which reflects a…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…