Related papers: Exponentials and $R$-recurrent random walks on gro…

We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…

Let $\mu$ be a borelian probability measure on $\mathbf{G}:=\mathrm{SL}_d(\mathbb{Z}) \ltimes \mathbb{T}^d$. Define, for $x\in \mathbb{T}^d$, a random walk starting at $x$ denoting for $n\in \mathbb{N}$, \[ \left\{\begin{array}{rcl} X_0…

We consider one-dependent random walks on $\mathbb{Z}^d$ in random hypergeometric environment for $d\ge 3$. These are memory-one walks in a large class of environments parameterized by positive weights on directed edges and on pairs of…

Let $X_1, X_2, \ldots$ be i.i.d. random variables with values in $\mathbb{Z}^d$ satisfying $\mathbb{P} \left(X_1=x\right) = \mathbb{P} \left(X_1=-x\right) = \Theta \left(\|x\|^{-s}\right)$ for some $s>d$. We show that the random walk…

Let $(X, \cal B, \nu)$ be a probability space and let $\Gamma$ be a countable group of $\nu$-preserving invertible maps of $X$ into itself. To a probability measure $\mu$ on $\Gamma$ corresponds a random walk on $X$ with Markov operator $P$…

A random walk in random scenery $(Y_n)_{n\in\mathbb{N}}$ is given by $Y_n=\xi_{S_n}$ for a random walk $(S_n)_{n\in\mathbb{N}}$ and iid random variables $(\xi_n)_{n\in\mathbb{Z}}$. In this paper, we will show the weak convergence of the…

A step reinforced random walk is a discrete time process with memory such that at each time step, with fixed probability $p \in (0,1)$, it repeats a previously performed step chosen uniformly at random while with complementary probability…

In this short note we give various near optimal characterizations of random walks over finite Abelian groups with large maximum discrepancy from the uniform measure. We also provide several interesting connections to existing results in the…

A deterministic walk in a random environment can be understood as a general random process with finite-range dependence that starts repeating a loop once it reaches a site it has visited before. Such process lacks the Markov property. We…

Under some mild condition, a random walk in the plane is recurrent. In particular each trajectory is dense, and a natural question is how much time one needs to approach a given small neighborhood of the origin. We address this question in…

A random walk on a group is noise sensitive if resampling every step independantly with a small probability results in an almost independant output. We precisely define two notions: $\ell^1$-noise sensitivity and entropy noise sensitivity.…

Famously, a $d$-dimensional, spatially homogeneous random walk whose increments are non-degenerate, have finite second moments, and have zero mean is recurrent if $d \in \{1,2\}$ but transient if $d \geq 3$. Once spatial homogeneity is…

We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…

We introduce a persistent random walk model with finite velocity and self-reinforcing directionality, which explains how exponentially distributed runs self-organize into truncated L\'evy walks observed in active intracellular transport by…

Our paper gives bounds for the rate of convergence for a class of random walks on the d-dimensional torus generated by a set of n vectors in R^d/Z^d. We give bounds on the discrepancy distance from Haar measure; our lower bound holds for…

The main aim of the present set of notes is to give new, short and essentially self-contained proofs of some classical, as well as more recent, results about random walks on groups. For instance, we shall see that the drift characterization…

Let (Z_n)_{n\in\N_0} be a d-dimensional random walk in random scenery, i.e., Z_n=\sum_{k=0}^{n-1}Y_{S_k} with (S_k)_{k\in\N_0} a random walk in Z^d and (Y_z)_{z\in Z^d} an i.i.d. scenery, independent of the walk. We assume that the random…

It is known that every infinite index quasi-convex subgroup $H$ of a non-elementary hyperbolic group $G$ is a free factor in a larger quasi-convex subgroup of $G$. We give a probabilistic generalization of this result. That is, we show that…

Considering homogeneous and oscillating random walks on the integers, we simplify classical works on recurrence of Spitzer and Kemperman, respectively. Some links with renewal theory are discussed.

The random walk with choice is a well known variation to the random walk that first selects a subset of $d$ neighbours nodes and then decides to move to the node which maximizes the value of a certain metric; this metric captures the number…