Related papers: How two elephants can learn from each other
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…
The goal of this paper is to investigate the asymptotic behavior of the multidimensional elephant random walk with stops (MERWS). In contrast with the standard elephant random walk, the elephant is allowed to stay on his own position. We…
Colonies of ants are systems of interacting living organisms in which interactions between individuals and their environment can produce a reliable performance of a complex tasks without the need for centralised control. Particularly…
For the standard elephant random walk, Laulin (2022) studied the case when the increment of the random walk is not uniformly distributed over the past history instead has a power law distribution. We study such a problem for the…
We study how conditioning affects the long-term behavior of the Elephant Random Walk, focusing on its first return to the origin, namely, the time it takes to forget the training. When the walker is conditioned to be at position $n$ at time…
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$,…
We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…
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…
We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…
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…
Consider a flock of birds that fly interacting between them. The interactions are modelled through a hierarchical system in which each bird, at each time step, adjusts its own velocity according to his past velocity and a weighted mean of…
Reflecting boundary conditions cause two one-dimensional random walks to synchronize if a common direction is chosen in each step. The mean synchronization time and its standard deviation are calculated analytically. Both quantities are…
The random flights are (continuous time) random walkswith finite velocity. Often, these models describe the stochastic motions arising in biology. In this paper we study the large time asymptotic behavior of random flights. We prove the…
We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…
We establish some limit theorems for one-dimensional elephant random walk, including Berry-Esseen bounds, Cram\'{e}r moderate deviations and local limit theorems. These limit theorems can be regarded as refinements of the central limit…
In the present paper, we introduce and analyze elephant random walks (ERWs) on bipartite periodic lattices arising as coverings of dipole graphs. We focus on lattices whose admissible step directions in the two parts of the bipartition are…
Consider a string of N+1 damped oscillators moving on the line of which the motion of the first (called the "leader") is independent of the others. Each of the followers `observes' the relative velocity and position of only its nearest…
We consider the elephant random walk with general step distribution. We calculate the first four moments of the limiting distribution of the position rescaled by $n^\alpha$ in the superdiffusive regime where $\alpha$ is the memory…
We use a method, inspired by Pohozeav's work, to study asymptotic behaviors of non-variational elliptic systems in dimension n greater than two. The results apply to changing sign solutions.
The interaction between elephants and their environment has profound implications for both ecology and conservation strategies. This study presents an analytical approach to decipher the intricate patterns of elephant movement in…