Related papers: Two-dimensional Rademacher walk

Reflected random walk in higher dimension arises from an ordinary random walk (sum of i.i.d. random variables): whenever one of the reflecting coordinates becomes negative, its sign is changed, and the process continues from that modified…

As an extension of Polya's classical result on random walks on the square grids ($\Z^d$), we consider a random walk where the steps, while still have unit length, point to different directions. We show that in dimensions at least 4, the…

We prove a strong law of large numbers and an annealed invariance principle for a random walk in a one-dimensional dynamic random environment evolving as the simple exclusion process with jump parameter $\gamma$. First, we establish that if…

Suppose that $(X,Y,Z)$ is a random walk in $\mathbb{Z}^3$ that moves in the following way: on the first visit to a vertex only $Z$ changes by $\pm 1$ equally likely, while on later visits to the same vertex $(X,Y)$ performs a…

We study the mean first passage time of a one-dimensional random walker with step sizes decaying exponentially in discrete time. That is step sizes go like $\lambda^{n}$ with $\lambda\leq1$ . We also present, for pedagogical purposes, a…

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 study the once-reinforced random walk on $\mathbb Z^d$, which is a self-interacting walk that has a higher probability to cross edges that were already visited. We prove that the walk is transient when $d\ge 6$ and when the reinforcement…

We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience,…

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…

Consider an arbitrary transient random walk on $\Z^d$ with $d\in\N$. Pick $\alpha\in[0,\infty)$ and let $L_n(\alpha)$ be the spatial sum of the $\alpha$-th power of the $n$-step local times of the walk. Hence, $L_n(0)$ is the range,…

In random walk theory, it is customary to assume that a given walk is irreducible and/or aperiodic. While these prevailing assumptions make particularly tractable the analysis of random walks and help to highlight their diffusive nature,…

We consider the random walk in an \emph{i.i.d.} random environment on the infinite $d$-regular tree for $d \geq 3$. We consider the tree as a Cayley graph of free product of finitely many copies of $\Zbold$ and $\Zbold_2$ and define the…

We consider a generalized version of a directionally reinforced random walk, which was originally introduced by Mauldin, Monticino, and von Weizs\"{a}cker in \cite{drw}. Our main result is a stable limit theorem for the position of the…

We introduce a class of nearest-neighbor integer random walks in random and non-random media, which includes excited random walks considered in the literature. At each site the random walker has a drift to the right, the strength of which…

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…

This paper is a sequel to Chaika and Krishnan [arXiv:1612.00434]. We again consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice Z^d. We assume that once walks meet, they…

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),…

We study a discrete time self interacting random process on graphs, which we call Greedy Random Walk. The walker is located initially at some vertex. As time evolves, each vertex maintains the set of adjacent edges touching it that have not…

We study, in d-dimensions, the random walker with geometrically shrinking step sizes at each hop. We emphasize the integrated quantities such as expectation values, cumulants and moments rather than a direct study of the probability…

Given any $\gamma>0$ and for $\eta=\{\eta_v\}_{v\in \mathbb Z^2}$ denoting a sample of the two-dimensional discrete Gaussian free field on $\mathbb Z^2$ pinned at the origin, we consider the random walk on~$\mathbb Z^2$ among random…