Related papers: Excited random walks with Markovian cookie stacks

In this paper we study the dynamics of nonlinear random walks. While typical random walks on networks consist of standard Markov chains whose static transition probabilities dictate the flow of random walkers through the network, nonlinear…

We study a one-dimensional random walk with memory in which the step lengths to the left and to the right evolve at each step in order to reduce the wandering of the walker. The feedback is quite efficient and lead to a non-diffusive walk.…

We show that for an i.i.d. bounded and weakly elliptic cookie environment, one dimensional excited random walk on the $k$-time leftover environment is right transient if and only if $\delta > k+1$ and has positive speed if and only if…

The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{\'e}vy walks for which the persistence times depend on some internal…

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 consider excited random walks (ERWs) on integers with a bounded number of i.i.d. cookies per site without the non-negativity assumption on the drifts induced by the cookies. Kosygina and Zerner [KZ08] have shown that when the total…

In this paper, we propose and analyze a novel one-dimensional inhomogeneous random walk model that combines spatial decay of transition probabilities with a temporal renewal structure for each excursion. In this model, the probability of…

We consider a directed version of the classical Stochastic Block Model with $m\ge 2$ communities and a parameter $\alpha$ controlling the inter-community connectivity. We show that, depending on the scaling of $\alpha$, the mixing time of…

We consider the two-dimensional simple random walk conditioned on never hitting the origin. This process is a Markov chain, namely it is the Doob $h$-transform of the simple random walk with respect to the potential kernel. It is known to…

We analyze the probability distributions of the quantum walks induced from Markov chains by Szegedy (2004). The first part of this paper is devoted to the quantum walks induced from finite state Markov chains. It is shown that the…

We consider a walker moving in a one-dimensional interval with absorbing boundaries under the effect of Markovian resettings to the initial position. The walker's motion follows a random walk characterized by a general waiting time…

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…

We introduce a non-equilibrium discrete-time random walk model on multiplex networks, in which at each time step the walker first undergoes a random jump between neighboring nodes in the same layer, and then tries to hop from one node to…

We study random walks on dynamically evolving graphs, where the environment is given by a time-dependent subset of the edges of an underlying graph. Concretely, following the recently introduced framework of Lelli and Stauffer, we consider…

We consider $d$ random walks $\big(S_n^{(j)}\big)_{n\in\mathbb{N}}$, $1\leq j \leq d$, in the same random environment $\omega$ in $\mathbb{Z}$, and a recurrent simple random walk $(Z_n)_{n\in\mathbb{N}}$ on $\mathbb{Z}$. We assume that,…

We suggest a model for data losses in a single node of a packet-switched network (like the Internet) which reduces to one-dimensional discrete random walks with unusual boundary conditions. The model shows critical behavior with an abrupt…

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…

Central limit theorems for random walks in quenched random environments have attracted plenty of attention in the past years. More recently still, finer local limit theorems -- yielding a Gaussian density multiplied by a highly oscillatory…

A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…

We consider a particle moving in continuous time as a Markov jump process; its discrete chain is given by an ordinary random walk on ${\mathbb Z}^d$ , and its jump rate at $({\mathbf x},t)$ is given by a fixed function $\varphi$ of the…