English
Related papers

Related papers: Random Memory Walk

200 papers

We introduce a new random walk with unbounded memory obtained as a mixture of the Elephant Random Walk and the Dynamic Random Walk which we call the Dynamic Elephant Random Walk (DERW). As a consequence of this mixture the distribution of…

Probability · Mathematics 2021-02-04 Cristian F. Coletti , Lucas R. de Lima , Renato J. Gava , Denis A. Luiz

We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…

Probability · Mathematics 2016-06-14 Jonathon Peterson

We consider a discrete random walk (RW) in n dimensions . The RW is adapted with a geometric absorption process: at any discrete time there is a constant probability that absorption occurs in the current state. To model the RW with…

Probability · Mathematics 2013-09-05 Theo van Uem

Given a random walk $(S_n)$ with typical step distributed according to some fixed law and a fixed parameter $p \in (0,1)$, the associated positively step-reinforced random walk is a discrete-time process which performs at each step, with…

Probability · Mathematics 2022-10-19 Marco Bertenghi , Alejandro Rosales-Ortiz

We introduce a simulation-based, amortised Bayesian inference scheme to infer the parameters of random walks. Our approach learns the posterior distribution of the walks' parameters with a likelihood-free method. In the first step a graph…

Machine Learning · Computer Science 2022-12-07 Hippolyte Verdier , François Laurent , Alhassan Cassé , Christian Vestergaard , Jean-Baptiste Masson

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 a one-dimensional random walk with memory. The behavior of the walker is modified with respect to the simple symmetric random walk (SSRW) only when he is at the maximum distance ever reached from his starting point (home). In this…

Data Analysis, Statistics and Probability · Physics 2013-09-27 Maurizio Serva

Elephant random walk, introduced to study the effect of memory on random walks, is a novel type of walk that incorporates the information of one randomly chosen past step to determine the future step. However, memory of a process can be…

Probability · Mathematics 2025-09-15 Krishanu Maulik , Parthanil Roy , Tamojit Sadhukhan

Quantum walks with memory(QWM) are a type of modified quantum walks that record the walker's latest path. As we know, only two kinds of QWM are presented up to now. It is desired to design more QWM for research, so that we can explore the…

Quantum Physics · Physics 2016-04-20 Dan Li , Michael Mc Gettrick , Fei Gao , Jie Xu , Qiao-Yan Wen

Under certain circumstances, a swarm of a species of trail-laying ants known as army ants can become caught in a doomed revolving motion known as the death spiral, in which each ant follows the one in front of it in a never-ending loop…

Analysis of PDEs · Mathematics 2017-03-21 Ria Das

In this article we shall derive functional limit theorems for the multi-dimensional elephant random walk (MERW) and thus extend the results provided for the one-dimensional marginal by Bercu and Laulin (2019). The MERW is a non-Markovian…

Probability · Mathematics 2021-09-06 Marco Bertenghi

In this article we study a one dimensional model for a polymer in a poor solvent: the random walk on $\mathbb{Z}$ penalized by its range. More precisely, we consider a Gibbs transformation of the law of the simple symmmetric random walk by…

Probability · Mathematics 2022-07-21 Nicolas Bouchot

We give a complete and unified description -- under some stability assumptions -- of the functional scaling limits associated with some persistent random walks for which the recurrent or transient type is studied in [1]. As a result, we…

Probability · Mathematics 2016-12-02 Peggy Cénac , Arnaud Le Ny , Basile De Loynes , Yoann Offret

The cover time is defined as the time needed for a random walker to visit every site of a confined domain. Here, we focus on persistent random walks, which provide a minimal model of random walks with short range memory. We derive the exact…

Statistical Mechanics · Physics 2015-06-19 Marie Chupeau , Olivier Bénichou , Raphaël Voituriez

In this article, a localisation result is proved for the biased random walk on the range of a simple random walk in high dimensions (d \geq 5). This demonstrates that, unlike in the supercritical percolation setting, a slowdown effect…

Probability · Mathematics 2012-03-05 David Croydon

We consider a minimal model of one-dimensional discrete-time random walk with step-reinforcement, introduced by Harbola, Kumar, and Lindenberg (2014): The walker can move forward (never backward), or remain at rest. For each $n=1,2,\cdots$,…

Probability · Mathematics 2020-07-13 Tatsuya Miyazaki , Masato Takei

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 introduce a natural family of random walks on the set of integers that scale to fractional Brownian motion. The increments X_n have the property that given {X_k: k < n}, the conditional law of X_n is that of X_{n-k_n}, where k_n is…

Probability · Mathematics 2011-07-12 Alan Hammond , Scott Sheffield

Random walks provide a simple conventional model to describe various transport processes, for example propagation of heat or diffusion of matter through a medium. However, in many practical cases the medium is highly irregular due to…

Probability · Mathematics 2019-06-10 L. V. Bogachev

The purpose of this paper is to investigate the asymptotic behavior of the multi-dimensional elephant random walk (MERW). It is a non-Markovian random walk which has a complete memory of its entire history. A wide range of literature is…

Probability · Mathematics 2017-09-22 Bernard Bercu , Lucile Laulin