Related papers: Speed Function for Biased Random Walks with Traps

An excited random walk is a non-Markovian extension of the simple random walk, in which the walk's behavior at time $n$ is impacted by the path it has taken up to time $n$. The properties of an excited random walk are more difficult to…

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…

We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…

We study the win rate $R_{N_d}/N_d$ of a biased simple random walk $S_n$ on $\mathbb{Z}$ at the first-passage time $N_d=\inf\{n\ge 0:S_n=d\}$, with $p=P[X_1=+1]\in[1/2,1)$. Using generating-function techniques and integral representations,…

We analyze the dynamics of random walks in which the jumping probabilities are periodic {\it time-dependent} functions. In particular, we determine the survival probability of biased walkers who are drifted towards an absorbing boundary.…

We studied simple random-walk models with asymmetric time delays. Stochastic simulations were performed for hyperbolic-tangent fitness functions and to obtain analytical results we approximated them by step functions. A novel behavior has…

We study the biased random walk where at each step of a random walk a "controller" can, with a certain small probability, move the walk to an arbitrary neighbour. This model was introduced by Azar et al. [STOC'1992]; we extend their work to…

We give a complete classification of scaling limits of randomly trapped random walks and associated clock processes on $\mathbb Z^d$, $d\ge 2$. Namely, under the hypothesis that the discrete skeleton of the randomly trapped random walk has…

We consider several variants of a class of random walks whose increment distributions depend on the average value of the process over its most recent $N$ steps. We investigate the speed of the process, and in particular, the limiting speed…

We study the biased random walk process in random uncorrelated networks with arbitrary degree distributions. In our model, the bias is defined by the preferential transition probability, which, in recent years, has been commonly used to…

We consider a continuous time random walk $X$ in random environment on $\Z^+$ such that its potential can be approximated by the function $V: \R^+\to \R$ given by $V(x)=\sig W(x) -\frac{b}{1-\alf}x^{1-\alf}$ where $\sig W$ a Brownian motion…

We analyze a trapping reaction with a single penetrable trap, in a one dimensional lattice, where both species (particles and trap) are mobile and have a drift velocity. We obtain the density as seen from a reference system attached to the…

We consider a self-attracting random walk in dimension d=1, in presence of a field of strength s, which biases the walker toward a target site. We focus on the dynamic case (true reinforced random walk), where memory effects are implemented…

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 present a comparative study of several algorithms for an in-plane random walk with a variable step. The goal is to check the efficiency of the algorithm in the case where the random walk terminates at some boundary. We recently found…

In continuum one-dimensional space, a coupled directed continuous time random walk model is proposed, where the random walker jumps toward one direction and the waiting time between jumps affects the subsequent jump. In the proposed model,…

In this paper we consider the one-dimensional, biased, randomly trapped random walk when the trapping times have infinite variance. We prove sufficient conditions for the suitably scaled walk to converge to a transformation of a stable…

The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…

We investigate the asymptotic behaviour of a class of self-interacting nearest neighbour random walks on the one-dimensional integer lattice which are pushed by a particular linear combination of their own local time on edges in the…

For a random walk in an elliptic i.i.d. random environment in dimension greater than or equal to 4, satisfying the a ballisticity condition slightly weaker than condition (T'), We consider the probability of linear slowdown. We show an…