相关论文: The Shark Random Swim (L\'evy flight with memory)
We consider in this article an Elephant Random Walk evolving in the plane. Specifically, this is a reinforced stochastic process in which the $n$th step is given by a random rotation of one of the previous steps chosen uniformly at random.…
We consider a discrete-time random walk where the random increment at time step $t$ depends on the full history of the process. We calculate exactly the mean and variance of the position and discuss its dependence on the initial condition…
We define a linearly reinforced process called the *-Edge-Reinforced Random Walk (*-ERRW ) which can be seen as a Yaglom reversible, hence non-reversible, extension of the Edge-Reinforced Random Walk (ERRW) introduced by Coppersmith and…
The step-reinforced random walk (SRRW), where each step may replicate a randomly chosen past step, exhibits complex dependencies on the history. This paper introduces a generalized SRRW on groups, incorporating arbitrary transformations of…
A new class of one-dimensional, discrete time random walk model with memory, termed "Random walk with $n$ memory channels" (RW$n$MC) is proposed. In this model the information of $n$ ($n\in \mathbb{Z}$) previous steps from the walker's…
We present a simple model of a random walk with partial memory, which we call the \emph{random memory walk}. We introduce this model motivated by the belief that it mimics the behavior of the once-reinforced random walk in high dimensions…
Random walk in random environment (RWRE) is a fundamental model of statistical mechanics, describing the movement of a particle in a highly disordered and inhomogeneous medium as a random walk with random jump probabilities. It has been…
In this report, we introduce the elephant random walk on the triangular lattice over $R^2$ incorporating directions by extending the model developed in \cite{baur2016elephant}. We study the behavior of the walk by finding the appropriate…
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…
The loop-erased random walk (LERW) in $\mathbb{Z}^4$ is the process obtained by erasing loops chronologically for simple random walk. We prove that the escape probability of the LERW renormalized by $(\log n)^{\frac{1}{3}}$ converges almost…
We study how memory impacts passages at the origin for a so-called elephant random walk in the diffusive regime. We observe that the number of zeros always grows asymptotically like the square root of the time, despite the fact that,…
We study the limiting behaviors of a generalized elephant random walk on the integer lattice. This random walk is defined by using two sequences of parameters expressing the memory at each step from the whole past and the drift of each step…
The one-dimensional elephant random walk is a typical model of discrete-time random walk with step-reinforcement, and is introduced by Sch\"{u}tz and Trimper (2004). It has a parameter $\alpha \in (-1,1)$: The case $\alpha=0$ corresponds to…
We explore the impact of long-range memory on the properties of a family of quantum walks in a one-dimensional lattice and discrete time, which can be understood as the quantum version of the classical "Elephant Random Walk" non-Markovian…
The elephant random walk is a history-dependent random walk. We study a class of interacting elephant random walks. Our model includes the exclusion process as a special case. By means of Monte Carlo simulations and mean-field arguments, we…
An analytic formulation of memory-possessing random walks introduced recently [Cressoni et al., Phys. Rev. Lett. 98, 070603 (2007) and Sch\"utz and Trimper, Phys. Rev. E 70, 045101 (2004)] for Alzheimer behavior and related phenomena is…
The aim of this paper is to deepen the analysis of the asymptotic behavior of the so-called minimal random walk (MRW) using a new martingale approach. The MRW is a discrete-time random walk with infinite memory that has three regimes…
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…
When the memory parameter of the elephant random walk is above a critical threshold, the process becomes superdiffusive and, once suitably normalised, converges to a non-Gaussian random variable. In a recent paper by the three first…
Reinforced random walks are random walks on graphs whose transition probabilities along edges from a vertex are proportional to the weights of those edges, but where the weight of an edge evolves in a way that depends on the past traversals…