Related papers: Generalized Many-Dimensional Excited Random Walk i…

We study the Ergodic Properties of Random Walks in stationary ergodic environments without uniform ellipticity under a minimal assumption. There are two main components in our work. The first step is to adopt the arguments of Lawler to…

Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$ and consider a simple symmetric random walk that is killed upon hitting one of the obstacles. For $d \geq 2$ and $p$ strictly above the critical…

We prove ballistic behaviour as well as an annealed functional central limit theorem for random walks in mixing random environments (RWRE). The ballistic hypothesis will be an effective polynomial condition as the one introduced by Berger,…

The Random Walk Pinning Model (RWPM) is a statistical mechanics model in which the trajectory of a continuous time random walk $X=(X_t)_{t\geq 0}$ is rewarded according to the time it spends together with a moving catalyst. More…

We are concerned with random walks on $\mathbb{Z}^d$, $d\geq 3$, in an i.i.d. random environment with transition probabilities $\epsilon$-close to those of simple random walk. We assume that the environment is balanced in one fixed…

We prove a law of large numbers for certain random walks on certain attractive dynamic random environments when initialised from all sites equal to the same state. This result applies to random walks on $\mathbb{Z}^d$ with $d\geq1$. We…

We prove a quantitative Russo-Seymour-Welsh (RSW) type result for random walks on two natural examples of random planar graphs: the supercritical percolation cluster in the square lattice and the Poisson Voronoi triangulation in the plane.…

Simple random walks are a basic staple of the foundation of probability theory and form the building block of many useful and complex stochastic processes. In this paper we study a natural generalization of the random walk to a process in…

Deterministic walk in an excited random environment is a non-Markov integer-valued process $(X_n)_{n=0}^{\infty}$, whose jump at time $n$ depends on the number of visits to the site $X_n$. The environment can be understood as stacks of…

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…

We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…

We consider Activated Random Walk (ARW), a particle system with mass conservation, on the cycle $\mathbb{Z}/n\mathbb{Z}$. One starts with a mass density $\mu>0$ of initially active particles, each of which performs a simple symmetric random…

In the simple random walk the steps are independent, whereas in the Elephant Random Walk (ERW), which was introduced by Sch\"utz and Trimper in 2004, the next step always depends on the whole path so far. In an earlier paper we investigated…

We consider random walks in a random environment of the type p_0+\gamma\xi_z, where p_0 denotes the transition probabilities of a stationary random walk on \BbbZ^d, to nearest neighbors, and \xi_z is an i.i.d. random perturbation. We give…

Let $G=(V,E)$ be a $d$-regular graph on $n$ vertices and let $\mu_0$ be a probability measure on $V$. The act of moving to a randomly chosen neighbor leads to a sequence of probability measures supported on $V$ given by $\mu_{k+1} = A…

We consider random walks, say $W_n=(M_0, M_1,\dots, M_n)$, of length $n$ starting at 0 and based on the martingale sequence $M_k$ with differences $X_m=M_m-M_{m-1}$. Assuming that the differences are bounded, $|X_m|\leq 1$, we solve the…

We study random walks on the giant component of the Erd\H{o}s-R\'enyi random graph ${\cal G}(n,p)$ where $p=\lambda/n$ for $\lambda>1$ fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently…

In this paper we consider an excited random walk on $\mathbb{Z}$ in identically piled periodic environment. This is a discrete time process on $\mathbb{Z}$ defined by parameters $(p_1,\dots p_M) \in [0,1]^M$ for some positive integer $M$,…

In the context of order statistics of discrete time random walks (RW), we investigate the statistics of the gap, $G_n$, and the number of time steps, $L_n$, between the two highest positions of a Markovian one-dimensional random walker,…

This article extends the results of Fang & Zeitouni (2012a) on branching random walks (BRWs) with Gaussian increments in time inhomogeneous environments. We treat the case where the variance of the increments changes a finite number of…