Related papers: Slow Recurrences

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;…

For every $3/4\le \delta, \beta< 1$ satisfying $\delta\leq \beta < \frac{1+\delta}{2}$ we construct a finitely generated group $\Gamma$ and a (symmetric, finitely supported) random walk $X_n$ on $\Gamma$ so that its expected distance from…

In this article, we propose a variant of the usual Ostrowski $\alpha$-numeration (where $\alpha$ is a real in [0, 1[) that codes integers (positive as well as negative) and reals of [0, 1[ (instead of [--$\alpha$, 1--$\alpha$[), so that for…

Given two relatively prime positive integers $\alpha$ and $\beta$, we consider simple lattice paths (with unit East and unit North steps) from $(0,0)$ to $(\alpha k,\beta k)$, and enumerate them by their left and right bounces with respect…

The Polya number of a classical random walk on a regular lattice is known to depend solely on the dimension of the lattice. For one and two dimensions it equals one, meaning unit probability to return to the origin. This result is extremely…

This article studies vertex reinforced random walks that are non-backtracking (denoted VRNBW), i.e. U-turns forbidden. With this last property and for a strong reinforcement, the emergence of a path may occur with positive probability.…

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 assume here that their distributions…

In this article, we first give a comprehensive description of random walk (RW) problem focusing on self-similarity, dynamic scaling and its connection to diffusion phenomena. One of the main goals of our work is to check how robust the RW…

We introduce random walks in a sparse random environment on $\mathbb Z$ and investigate basic asymptotic properties of this model, such as recurrence-transience, asymptotic speed, and limit theorems in both the transient and recurrent…

We study the first detected recurrence time problem of continuous-time quantum walks on graphs. While previous works have employed projective measurements to determine the first return time, we implement a protocol based on weak…

In recent years, there has been an interest in deriving certain important probabilistic results as consequences of deterministic ones; see for instance \cite{beig} and \cite{acc}. In this work, we continue on this path by deducing a well…

We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…

Benjamini, Haggstrom, Peres and Steif introduced the concept of a dynamical random walk. This is a continuous family of random walks, {S_n(t)}. Benjamini et. al. proved that if d=3 or d=4 then there is an exceptional set of t such that…

In this work, we study open quantum random walks, as described by S. Attal et al. These objects are given in terms of completely positive maps acting on trace-class operators, leading to one of the simplest open quantum versions of the…

We consider a one-dimensional random walk among biased i.i.d. conductances, in the case where the random walk is transient but sub-ballistic: this occurs when the conductances have a heavy-tail at $+\infty$ or at $0$. We prove that the…

We consider two continuous-time generalizations of conservative random walks introduced in [J.Englander and S.Volkov (2022)], an orthogonal and a spherically-symmetrical one; the latter model is known as {\em random flights}. For both…

A subset $A$ of an abelian group $G$ is sequenceable if there is an ordering $(a_1, \ldots, a_k)$ of its elements such that the partial sums $(s_0, s_1, \ldots, s_k)$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i a_i$ for $1 \leq i \leq k$,…

We outline basic properties of a symmetric random walk in one dimension, in which the length of the nth step equals lambda^n, with lambda<1. As the number of steps N-->oo, the probability that the endpoint is at x, P_{lambda}(x;N),…

An excited random walk is a non-Markovian extension of the simple random walk, in which the walk's behavior at time $n$ is impacted by the path it has taken up to time $n$. The properties of an excited random walk are more difficult to…

We consider a centered random walk with finite variance and investigate the asymptotic behaviour of the probability that the area under this walk remains positive up to a large time $n$. Assuming that the moment of order $2+\delta$ is…