Related papers: A central limit theorem for unbalanced step-reinfo…
A detailed study is presented for a large class of uncoupled continuous-time random walks (CTRWs). The master equation is solved for the Mittag-Leffler survival probability. The properly scaled diffusive limit of the master equation is…
In the present paper, as a continuation of our preceding paper [10], we study another kind of central limit theorems (CLTs) for non-symmetric random walks on nilpotent covering graphs from a viewpoint of discrete geometric analysis…
We consider a recent model of random walk that recursively grows the network on which it evolves, namely the Tree Builder Random Walk (TBRW). We introduce a bias $\rho \in (0,\infty)$ towards the root, and exhibit a phase transition for…
Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We suppose that the distributions of…
We consider a one-dimensional simple symmetric exclusion process in equilibrium, constituting a dynamic random environment for a nearest-neighbor random walk that on occupied/vacant sites has two different local drifts to the right. We…
Recently, in ["The coin-turning walk and its scaling limit", Electronic Journal of Probability, 25 (2020)], the ``coin-turning walk'' was introduced on ${\mathbb Z}$. It is a non-Markovian process where the steps form a (possibly)…
We consider the random walk in an independent and identically distributed (i.i.d.) random environment on a Cayley graph of a finite free product of copies of $\mathbb{Z}$ and $\mathbb{Z}_2$. Such a Cayley graph is readily seen to be a…
We introduce a family of two-dimensional reflected random walks in the positive quadrant and study their Martin boundary. While the minimal boundary is systematically equal to a union of two points, the full Martin boundary exhibits an…
We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…
Under suitable moment assumptions, we show that a genuinely d-dimensional step-reinforced random walk undergoes a phase transition between recurrence and transience in dimensions $d=1,2$, and that it is transient for all reinforcement…
A random walk generated by a sum of independent identity distributed random variables with positive expectation is considered. The limiting distributions for the first- passage -time of a step-function boundary are derived.
We study linearly edge-reinforced random walks on $\mathbb{Z}_+$, where each edge $\{x,x+1\}$ has the initial weight $x^{\alpha} \vee 1$, and each time an edge is traversed, its weight is increased by $\Delta$. It is known that the walk is…
We construct the conditional version of $k$ independent and identically distributed random walks on $\R$ given that they stay in strict order at all times. This is a generalisation of so-called non-colliding or non-intersecting random…
We develop nonlinear renewal theorems for a perturbed random walk without assuming stochastic boundedness of centered perturbation terms. A second order expansion of the expected stopping time is obtained via the uniform integrability of…
In previous work by Avena and den Hollander, a model of a one-dimensional random walk in a dynamic random environment was proposed where the random environment is resampled from a given law along a growing sequence of deterministic times.…
We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges…
We prove a central limit theorem for the Horvitz-Thompson estimator based on the Gram-Schmidt Walk (GSW) design, recently developed in Harshaw et al.(2022). In particular, we consider the version of the GSW design which uses randomized…
In this paper we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for the number of edge, respectively of…
We consider a ballistic random walk in an i.i.d. random environment that does not allow retreating in a certain fixed direction. Homogenization and regeneration techniques combine to prove a law of large numbers and an averaged invariance…
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…