相关论文: Rate of growth of a transient cookie random walk

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 consider a random walk on integers where at the first visits to a site the walker gets a positive drift, but where after a certain number of visits the walker gets a negative drift. We prove that the walker is almost surely transient to…

We study one-dimensional excited random walks with non-nearest neighbor jumps. When the process is at a vertex that has not been visited before, its next transition has a positive drift to the right, possibly with long jumps. Whenever the…

We study the large deviations of one-dimensional excited random walks. We prove a large deviation principle for both the hitting times and the position of the random walk and give a qualitative description of the respective rate functions.…

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…

Consider a simple random walk on the integers with the following transition mechanism. At each site $x$, the probability of jumping to the right is $\omega(x)\in[\frac12,1)$, until the first time the process jumps to the left from site $x$,…

We consider a random walk in an i.i.d. random environment on Z that is perturbed by cookies of strength 1. The number of cookies per site is assumed to be i.i.d. Results on the speed of the random walk are obtained. Our main tool is the…

We study a class of nearest-neighbor discrete time integer random walks introduced by Zerner, the so called multi-excited random walks. The jump probabilities for such random walker have a drift to the right whose intensity depends on a…

In this paper we prove that under certain assumptions the transient random walk in random environment with bounded jumps (in $\mathbb{Z}$) grows much slower than the speed $n$. Precisely, there is $0<s<1$, such that although $X_n\rto$ we…

We consider a transient random walk $(X_n)$ in random environment on a Galton--Watson tree. Under fairly general assumptions, we give a sharp and explicit criterion for the asymptotic speed to be positive. As a consequence, situations with…

One dimensional excited random walk has been extensively studied for bounded, i.i.d. cookie environments. In this case, many important properties of the walk including transience or recurrence, positivity or non-positivity of the speed, and…

We study the excited random walk, in which a walk that is at a site that contains cookies eats one cookie and then hops to the right with probability p and to the left with probability q=1-p. If the walk hops onto an empty site, there is no…

Let $N$ and $M$ be positive integers satisfying $1\le M\le N$, and let $0<p_0<p_1<1$. Define a process $\{X_n\}_{n=0}^\infty$ on $\mathbb{Z}$ as follows. At each step, the process jumps either one step to the right or one step to the left,…

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…

We consider a nearest-neighbor random walk on $\mathbb{Z}$ whose probability $\omega_x(j)$ to jump to the right from site $x$ depends not only on $x$ but also on the number of prior visits $j$ to $x$. The collection…

We study a random walk on $\mathbb{Z}$ which evolves in a dynamic environment determined by its own trajectory. Sites flip back and forth between two modes, $p$ and $q$. $R$ consecutive right jumps from a site in the $q$-mode are required…

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].

The one-dimensional elephant random walk is a typical model of discrete-time random walk with step-reinforcement, and is introduced by Sch\"{u}tz and Trimper (2004). It has a parameter $\alpha \in (-1,1)$: The case $\alpha=0$ corresponds to…

We consider a random walk X_n in Z_+, starting at X_0=x>= 0, with transition probabilities P(X_{n+1}=X_n+1|X_n=y>=1)=1/2-\delta/(4y+2\delta) P(X_{n+1}=X_n+1|X_n=y>=1)=1/2+\delta/(4y+2\delta) and X_{n+1}=1 whenever X_n=0. We prove that the…

We consider a random walk X_n in non-i.i.d. environment and show that the ratio of log X_n to log n converges in probability to a positive constant.