Related papers: Mutually excited random walks

We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…

We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…

Consider continuous-time random walks on Cayley graphs where the rate assigned to each edge depends only on the corresponding generator. We show that the limiting speed is monotone increasing in the rates for infinite Cayley graphs that…

A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…

We consider biased random walk on supercritical percolation clusters in $\Z^2$. We show that the random walk is transient and that there are two speed regimes: If the bias is large enough, the random walk has speed zero, while if the bias…

We consider biased random walk among iid, uniformly elliptic conductances on $\mathbb{Z}^d$, and investigate the monotonicity of the velocity as a function of the bias. It is not hard to see that if the bias is large enough, the velocity is…

The balanced excited random walk, introduced by Benjamini, Kozma and Schapira in $2011$, is defined as a discrete time stochastic process in $\mathbb Z^d$, depending on two integer parameters $1\le d_1,d_2\le d$, which whenever it is at a…

In this note, by an elementary use of Girsanov's transform we show that the exit time for either a biased random walk or a drifted Brownian motion on a symmetric interval is stochastically monotone with respect to the drift parameter. In…

The probability that a one dimensional excited random walk in stationary ergodic and elliptic cookie environment is transient to the right (left) is either zero or one. This solves a problem posed by Kosygina and Zerner [8].

We develop a framework to determine the complete statistical behavior of a fundamental quantity in the theory of random walks, namely, the probability that $n_1$, $n_2$, $n_3$, . . . distinct sites are visited at times $t_1$, $t_2$, $t_3$,…

We study the asymptotics of the probabilities of extreme slowdown events for transient one-dimensional excited random walks. That is, if $\{X_n\}_{n\geq 0}$ is a transient one-dimensional excited random walk and $T_n = \min\{ k: \, X_k =…

We focus on two models of nearest-neighbour random walks on d-dimensional regular hyper-cubic lattices that are usually assumed to be identical - the discrete-time Polya walk, in which the walker steps at each integer moment of time, and…

We introduce a new type of random walk where the definition of edge reinforcement is very different from the one in the reinforced random walk models studied so far, and investigate its basic properties, such as null/positive recurrence,…

We consider the model of the one-dimensional cookie random walk when the initial cookie distribution is spatially uniform and the number of cookies per site is finite. We give a criterion to decide whether the limiting speed of the walk is…

We prove sharp asymptotic estimates for the rate of escape of the two-dimensional simple random walk conditioned to avoid a fixed finite set. We derive it from asymptotics available for the continuous analogue of this process (cf…

We study variable-speed random walks on $\mathbb Z$ driven by a family of nearest-neighbor time-dependent random conductances $\{a_t(x,x+1)\colon x\in\mathbb Z, t\ge0\}$ whose law is assumed invariant and ergodic under space-time shifts. We…

We study certain self-interacting walks on the set of integers, that choose to jump to the right or to the left randomly but influenced by the number of times they have previously jumped along the edges in the finite neighbourhood of their…

We consider a two-speed branching random walk, which consists of two macroscopic stages with different reproduction laws. We prove that the centered maximum converges in law to a Gumbel variable with a random shift and the extremal process…

We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…

We consider random walks with finite second moment which drifts to $-\infty$ and have heavy tail. We focus on the events when the minimum and the final value of this walk belong to some compact set. We first specify the associated…