English
Related papers

Related papers: Variations of the elephant random walk

200 papers

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…

Probability · Mathematics 2009-07-15 Olivier Raimond , Bruno Schapira

We study a random walk model in which the jumping probability to a site is dependent on the number of previous visits to the site, as a model of the mobility with memory. To this end we introduce two parameters called the memory parameter…

Physics and Society · Physics 2016-11-11 Jeehye Choi , Jang-Il Sohn , K. -I. Goh , I. -M. Kim

Let (Z_n)_{n\in\N_0} be a d-dimensional random walk in random scenery, i.e., Z_n=\sum_{k=0}^{n-1}Y_{S_k} with (S_k)_{k\in\N_0} a random walk in Z^d and (Y_z)_{z\in Z^d} an i.i.d. scenery, independent of the walk. We assume that the random…

Probability · Mathematics 2016-08-16 Remco van der Hofstad , Nina Gantert , Wolfgang König

We present a continuous time generalization of a random walk with complete memory of its history [Phys. Rev. E 70, 045101(R) (2004)] and derive exact expressions for the first four moments of the distribution of displacement when the number…

Statistical Mechanics · Physics 2007-05-23 Francis N. C. Paraan , J. P. Esguerra

We study, in d-dimensions, the random walker with geometrically shrinking step sizes at each hop. We emphasize the integrated quantities such as expectation values, cumulants and moments rather than a direct study of the probability…

Statistical Mechanics · Physics 2009-11-11 Tonguc Rador

We present a random walk model that exhibits asymptotic subdiffusive, diffusive, and superdiffusive behavior in different parameter regimes. This appears to be the first instance of a single random walk model leading to all three forms of…

Mathematical Physics · Physics 2015-05-19 Niraj Kumar , Upendra Harbola , Katja Lindenberg

We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…

Probability · Mathematics 2023-07-26 Theo van Uem

Random walkers characterized by random positions and random velocities lead to normal diffusion. A random walk was originally proposed by Einstein to model Brownian motion and to demonstrate the existence of atoms and molecules. Such a…

Statistical Mechanics · Physics 2018-08-01 Daniel Escaff , Raul Toral , Christian Van den Broeck , Katja Lindenberg

For a random walk defined for a doubly infinite sequence of times, we let the time parameter itself be an integer-valued process, and call the orginal process a random walk at random time. We find the scaling limit which generalizes the…

Probability · Mathematics 2013-07-30 Paul Jung , Greg Markowsky

We study a simple run-and-tumble random walk whose switching frequency from run mode to tumble mode and the reverse depend on a stochastic signal. We consider a particularly sharp, step-like dependence, where the run to tumble switching…

Cell Behavior · Quantitative Biology 2019-01-09 Subrata Dev , Sakuntala Chatterjee

The Tree Builder Random Walk is a special random walk that evolves on trees whose size increases with time, randomly and depending upon the walker. After every s steps of the walker, a random number of vertices are added to the tree and…

Probability · Mathematics 2021-02-05 Giulio Iacobelli , Rodrigo Ribeiro , Glauco Valle , Leonel Zuaznabar

We outline basic properties of a symmetric random walk in one dimension, in which the length of the nth step equals lambda^n, with lambda<1. As the number of steps N-->oo, the probability that the endpoint is at x, P_{lambda}(x;N),…

Physics Education · Physics 2009-11-10 P. L. Krapivsky , S. Redner

We consider a nearest neighbor random walk on the one-dimensional integer lattice with drift towards the origin determined by an asymptotically vanishing function of the number of visits to zero. We show the existence of distinct regimes…

Probability · Mathematics 2007-12-03 Iddo Ben-Ari , Mathieu Merle , Alexander Roitershtein

Recently, a new model of quantum walk, utilizing recycled coins, was introduced; however little is yet known about its properties. In this paper, we study its behavior on the cycle graph. In particular, we will consider its time averaged…

Quantum Physics · Physics 2015-05-27 Walter O. Krawec

We study the elephant random walk in arbitrary dimension $d\geq 1$. Our main focus is the limiting random variable appearing in the superdiffusive regime. Building on a link between the elephant random walk and P\'olya-type urn models, we…

Probability · Mathematics 2024-04-18 Hélène Guérin , Lucile Laulin , Kilian Raschel

This paper is devoted to the asymptotic analysis of the reinforced elephant random walk (RERW) using a martingale approach. In the diffusive and critical regimes, we establish the almost sure convergence, the law of iterated logarithm and…

Probability · Mathematics 2021-06-30 Lucile Laulin

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,…

Probability · Mathematics 2017-12-13 Janos Englander , Stanislav Volkov

We consider one infinite path of a Random Walk in Random Environment (RWRE, for short) in an unknown environment. This environment consists of either i.i.d.\ site or bond randomness. At each position the random walker stops and tells us the…

Probability · Mathematics 2021-09-16 Jonas Jalowy , Matthias Löwe

For a generalized step reinforced random walk, starting from the origin, the first step is taken according to the first element of an innovation sequence. Then in subsequent epochs, it recalls a past epoch with probability proportional to a…

Probability · Mathematics 2025-05-12 Aritra Majumdar , Krishanu Maulik

The random walk with choice is a well known variation to the random walk that first selects a subset of $d$ neighbours nodes and then decides to move to the node which maximizes the value of a certain metric; this metric captures the number…

Data Structures and Algorithms · Computer Science 2010-07-20 John Alexandris , Gregory Karagiorgos 'and' Ioannis Stavrakakis