Related papers: Loop-weighted Walk

Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…

This paper deals with different models of random walks with a reinforced memory of preferential attachment type. We consider extensions of the Elephant Random Walk introduced by Sch\"utz and Trimper [2004] with a stronger reinforcement…

We analyze the dynamics of the Sisyphus random walk model, a discrete Markov chain in which the walkers may randomly return to their initial position $x_0$. In particular, we present a remarkably compact derivation of the time-dependent…

Reinforced random walks (RRWs), including vertex-reinforced random walks (VRRWs) and edge-reinforced random walks (ERRWs), model random walks where the transition probabilities evolve based on prior visitation history~\cite{mgr, fmk,…

We study a non-reversible random walk advected by the symmetric simple exclusion process, so that the walk has a local drift of opposite sign when sitting atop an occupied or an empty site. We prove that the back-tracking probability of the…

The parametric maximum likelihood estimation problem is addressed in the context of quantum walk theory for quantum walks on the lattice of integers. A coin action is presented, with the real parameter $\theta$ to be estimated identified…

The idea of adaptive walks on fitness landscapes as a means of studying evolutionary processes on large time scales is extended to fitness landscapes that are slowly changing over time. The influence of ruggedness and of the amount of…

We introduce a multidimensional walk with memory and random tendency. The asymptotic behaviour is characterized, proving a law of large numbers and showing a phase transition from diffusive to superdiffusive regimes. In first case, we…

Let $\xi$ n , n $\in$ N be a sequence of i.i.d. random variables with values in Z. The associated random walk on Z is S(n) = $\xi$ 1 + $\times$ $\times$ $\times$ + $\xi$ n+1 and the corresponding "reflected walk" on N 0 is the Markov chain…

We study absorbing phase transitions in the one-dimensional branching annihilating random walk with long-range repulsion. The repulsion is implemented as hopping bias in such a way that a particle is more likely to hop away from its closest…

We analyze the Brownian Motion limit of a prototypical unit step reinforced random-walk on the half line. A reinforced random walk is one which changes the weight of any edge (or vertex) visited to increase the frequency of return visits.…

We describe a new algorithm, the reflection method, to generate off-lattice random walks of specified, though arbitrarily large, thickness in $\mathbb{R}^3$ and prove that our method is ergodic on the space of thick walks. The data…

The main result of this paper is a general central limit theorem for distributions defined by certain renewal type equations. We apply this to weakly self-avoiding random walks. We give good error estimates and Gaussian tail estimates which…

We consider a random walker in a dynamic random environment given by a system of independent simple symmetric random walks. We obtain ballisticity results under two types of perturbations: low particle density, and strong local drift on…

We consider a one dimensional asymmetric random walk whose jumps are identical, independent and drawn from a distribution \phi(\eta) displaying asymmetric power law tails (i.e. \phi(\eta) \sim c/\eta^{\alpha +1} for large positive jumps and…

We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…

Random walk has wide applications in many fields, such as machine learning, biology, physics, and chemistry. Random walk can be discrete or continuous in time and space. Asymmetric random walk could be described by drift-diffusion equation.…

Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are…

We study a model of multi-excited random walk with non-nearest neighbour steps on $\mathbb Z$, in which the walk can jump from a vertex $x$ to either $x+1$ or $x-i$ with $i\in \{1,2,\dots,L\}$, $L\ge 1$. We first point out the multi-type…

We consider quantum random walks on congested lattices and contrast them to classical random walks. Congestion is modelled with lattices that contain static defects which reverse the walker's direction. We implement a dephasing process…