Related papers: Excited random walks with Markovian cookie stacks
We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains.…
We are interested in the asymptotic behavior of Markov chains on the set of positive integers for which, loosely speaking, large jumps are rare and occur at a rate that behaves like a negative power of the current state, and such that small…
Starting with a percolation model in $\Z^d$ in the subcritical regime, we consider a random walk described as follows: the probability of transition from $x$ to $y$ is proportional to some function $f$ of the size of the cluster of $y$.…
Deterministic walks over a random set of points in one and two dimensions (d=1,2) are considered. Points (``cities'') are randomly scattered in R^d following a uniform distribution. A walker (a ``tourist''), at each time step, goes to the…
Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the fraction of the time spent in each state during the stochastic…
A continuous-time random walk in the quarter plane with homogeneous transition rates is considered. Given a non-negative reward function on the state space, we are interested in the expected stationary performance. Since a direct derivation…
We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this paper, we study some asymptotic properties of this persistent…
We study the limit behaviour of upper and lower bounds on expected time averages in imprecise Markov chains; a generalised type of Markov chain where the local dynamics, traditionally characterised by transition probabilities, are now…
The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…
We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary (i.e., non-random) case, we allow any…
In a recent paper of Eichelsbacher and Koenig (2008) the model of ordered random walks has been considered. There it has been shown that, under certain moment conditions, one can construct a k-dimensional random walk conditioned to stay in…
Let $G$ be a nonamenable transitive unimodular graph. In dynamical percolation, every edge in $G$ refreshes its status at rate $\mu>0$, and following the refresh, each edge is open independently with probability $p$. The random walk…
We study a strongly Non-Markovian variant of random walk in which the probability of visiting a given site $i$ is a function $f$ of number of previous visits $v(i)$ to the site. If the probability is proportional to number of visits to the…
We provide a probabilistic analysis of the banker algorithm when transition probabilities may depend on time and space. The transition probabilities evolve, as time goes by, along the trajectory of an ergodic Markovian environment, whereas…
We study Markov chains on $\mathbb Z^m$, $m\geq 2$, that behave like a standard symmetric random walk outside of the hyperplane (membrane) $H=\{0\}\times \mathbb Z^{m-1}$. The transition probabilities on the membrane $H$ are periodic and…
A branching random walk in presence of an absorbing wall moving at a constant velocity $v$ undergoes a phase transition as the velocity $v$ of the wall varies. Below the critical velocity $v_c$, the population has a non-zero survival…
We study the quenched invariance principle for random conductance models with long range jumps on $\Z^d$, where the transition probability from $x$ to $y$ is, on average, comparable to $|x-y|^{-(d+\alpha)}$ with $\alpha\in (0,2)$ but is…
In this paper we study a substantial generalization of the model of excited random walk introduced in [Electron. Commun. Probab. 8 (2003) 86-92] by Benjamini and Wilson. We consider a discrete-time stochastic process $(X_n,n=0,1,2,...)$…
We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…