Related papers: Reinforced walks in two and three dimensions

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…

Quantum walks are versatile simulators of topological phases and phase transitions as observed in condensed matter physics. Here, we utilize a step dependent coin in quantum walks and investigate what topological phases we can simulate with…

Random walk is one of the most classical and well-studied model in probability theory. For two correlated random walks on lattice, every step of the random walks has only two states, moving in the same direction or moving in the opposite…

The presence of temporal correlations in random movement trajectories is a widespread phenomenon across biological, chemical and physical systems. The ubiquity of persistent and anti-persistent motion in many natural and synthetic systems…

We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…

Humans excel at robust bipedal walking in complex natural environments. In each step, they adequately tune the interaction of biomechanical muscle dynamics and neuronal signals to be robust against uncertainties in ground conditions.…

We consider a class of strongly edge-reinforced random walks, where the corresponding reinforcement weight function is nondecreasing. It is known, from Limic and Tarr\`{e}s [Ann. Probab. (2007), to appear], that the attracting edge emerges…

Motivated by the article [M. Takei, Electron. J. Probab. 26 (2021), article no. 104], we study the limit behavior of linearly edge-reinforced random walks on the half-line $\mathbb{Z}_+$ with reinforcement parameter $\delta>0$, and each…

In this paper we introduce the notion of Random Walk in Changing Environment - a random walk in which each step is performed in a different graph on the same set of vertices, or more generally, a weighted random walk on the same vertex and…

We study a family of correlated one-dimensional random walks with a finite memory range M.These walks are extensions of the Taylor's walk as investigated by Goldstein, which has a memory range equal to one. At each step, with a probability…

We describe a model for $m$ vertex reinforced interacting random walks on complete graphs with $d\geq 2$ vertices. The transition probability of a random walk to a given vertex depends exponentially on the proportion of visits made by all…

Under some mild condition, a random walk in the plane is recurrent. In particular each trajectory is dense, and a natural question is how much time one needs to approach a given small neighborhood of the origin. We address this question in…

We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…

Reflected random walk in higher dimension arises from an ordinary random walk (sum of i.i.d. random variables): whenever one of the reflecting coordinates becomes negative, its sign is changed, and the process continues from that modified…

We present a real space renormalization-group map for probabilities of random walks on a hierarchical lattice. From this, we study the asymptotic behavior of the end-to-end distance of a weakly self- avoiding random walk (SARW) that…

We establish recurrence criteria for sums of independent random variables which take values in Euclidean lattices of varying dimension. In particular, we describe transient inhomogenous random walks in the plane which interlace two…

In a recent Letter Ciftci and Cakmak [EPL 87, 60003 (2009)] showed that the two dimensional random walk in a bounded domain, where walkers which cross the boundary return to a base curve near origin with deterministic rules, can produce…

In a step reinforced random walk, at each integer time and with a fixed probability p $\in$ (0, 1), the walker repeats one of his previous steps chosen uniformly at random, and with complementary probability 1 -- p, the walker makes an…

We consider a one-dimensional simple random walk killed by quenched soft obstacles. The position of the obstacles is drawn according to a renewal process with a power-law increment distribution. In a previous work, we computed the…

In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the non positive horizontal half-axis. We call them "walks on the slit plane". We count them by their length,…