Related papers: Deterministic walk in an excited random environmen…

In this paper we study random walks on dynamical random environments in $1 + 1$ dimensions. Assuming that the environment is invariant under space-time shifts and fulfills a mild mixing hypothesis, we establish a law of large numbers and a…

We study a discrete-time random walk on the non-negative integers, such that when 0 is reached a jump occurs to an arbitrary location, with given probabilities. We obtain an asymptotic formula for the expected position at large times, in…

Using renewal times and Girsanov's transform, we prove that the speed of the excited random walk is infinitely differentiable with respect to the bias parameter in $(0,1)$ for the dimension $d\ge 2$. At the critical point $0$, using a…

Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…

We consider a random walk $\{S_n\}_{n\in \mathbb{N}}$ in time-inhomogeneous random environment $\xi$. For almost each realization of $\xi$, we formulate a quenched harmonic function, based on which we can define the random walk in random…

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…

We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the…

We consider a d-dimensional random quantum walk with site-dependent random coin operators. The corresponding transition coefficients are characterized by deterministic amplitudes times independent identically distributed site-dependent…

We study an unbiased, discrete time random walk on the nonnegative integers, with the origin absorbing. The process has a history-dependent step length: the walker takes steps of length v while in a region which has been visited before, and…

We consider a random walk in dimension $d\geq 1$ in a dynamic random environment evolving as an interchange process with rate $\gamma>0$. We only assume that the annealed drift is non-zero. We prove that the empirical velocity of the walker…

A transient stochastic process is considered strongly transient if conditioned on returning to the starting location, the expected time it takes to return the the starting location is finite. We characterize strong transience for a…

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

The rotor-router model is a deterministic process analogous to a simple random walk on a graph. This paper is concerned with a generalized model, functional-router model, which imitates a Markov chain possibly containing irrational…

Fix integers $d \geq 2$ and $k\geq d-1$. Consider a random walk $X_0, X_1, \ldots$ in $\mathbb{R}^d$ in which, given $X_0, X_1, \ldots, X_n$ ($n \geq k$), the next step $X_{n+1}$ is uniformly distributed on the unit ball centred at $X_n$,…

We consider a random walk in $\mathbb Z^d$ which jumps from a site $x$ to a nearest neighboring site $x+e$ (where $e\in V:=\{x\in\mathbb Z^d: |x|_1=1\}$) with probability $p_0(e)+\epsilon\xi(x,e)$. Here $\sum_e p_0(e)=1$, $p_0(e)> 0$,…

We find that a symbolic walk (performed by a walker with memory given by a Bernoulli shift) is able to distinguish between the random or chaotic topology of a given network. We show this result by means of studying the undirected baker…

We consider a model for a queue in which only a fixed number $N$ of customers can join. Each customer joins the queue independently at an exponentially distributed time. Assuming further that the service times are independent and follow an…

A one-dimensional confined Nonlinear Random Walk is a tuple of $N$ diffeomorphisms of the unit interval driven by a probabilistic Markov chain. For generic such walks, we obtain a geometric characterization of their ergodic stationary…

Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…

We consider an asexually reproducing population on a finite type space whose evolution is driven by exponential birth, death and competition rates, as well as the possibility of mutation at a birth event. On the individual-based level this…