相关论文: Estimates on Escape Times for the Elephant Random …
Our goal is to investigate the asymptotic behavior of the center of mass of the elephant random walk, which is a discrete-time random walk on integers with a complete memory of its whole history. In the diffusive and critical regimes, we…
As a strategy to complete games quickly, we investigate one-dimensional random walks where the step length increases deterministically upon each return to the origin. When the step length after the kth return equals k, the displacement of…
The purpose of this paper is to establish, via a martingale approach, some refinements on the asymptotic behavior of the one-dimensional elephant random walk (ERW). The asymptotic behavior of the ERW mainly depends on a memory parameter $p$…
We consider a generalized model of elephant random walks wherein the walker, during the $(n+1)$-st time-stamp, draws from the past (i.e. the set $\{1,2,\ldots,n\}$) a sample of $k$ time-stamps, either with replacement or without, where $k$…
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…
We study the asymptotic probability that a random walk with heavy-tailed increments crosses a high boundary on a random time interval. We use new techniques to extend results of Asmussen [Ann. Appl. Probab. 8 (1998) 354-374] to completely…
We consider a random walk with death in $[-N,N]$ moving in a time dependent environment. The environment is a system of particles which describes a current flux from $N$ to $-N$. Its evolution is influenced by the presence of the random…
In the simple random walk the steps are independent, whereas in the Elephant Random Walk (ERW), which was introduced by Sch\"utz and Trimper in 2004, the next step always depends on the whole path so far. In an earlier paper we investigated…
The aim of this paper is to investigate the asymptotic behavior of the so-called elephant random walk with stops (ERWS). In contrast with the standard elephant random walk, the elephant is allowed to be lazy by staying on his own position.…
We study the asymptotic behaviour of the number of times the elephant random walk in the critical regime visits the origin. Our result entails that most zeros of the critical elephant random walk occur shortly before its last passage time…
We identify a fundamental phenomenon of heterogeneous one dimensional random walks: the escape (traversal) time is maximized when the heterogeneity in transition probabilities forms a pyramid-like potential barrier. This barrier corresponds…
We study the enhanced diffusivity in the so called elephant random walk model with stops (ERWS) by including symmetric random walk steps at small probability $\epsilon$. At any $\epsilon > 0$, the large time behavior transitions from…
We evaluate the limit distribution of the maximal excursion of a random walk in any dimension for homogeneous environments and for self-similar supports under the assumption of spherical symmetry. This distribution is obtained in closed…
In this paper, we study the number of moves in a multidimensional elephant random walk with stops. We establish several convergence results for the number of moves, including the law of large numbers and the law of iterated logarithm. Using…
Motivated by novel results in the theory of complex adaptive systems, we analyze the dynamics of random walks in which the jumping probabilities are {\it time-dependent}. We determine the survival probability in the presence of an absorbing…
We consider the simple random walk on the $N$-dimensional integer lattice from the perspective of evaluating asymptotically the duration of play in the multidimensional gambler\apost s ruin problem. We show that, under suitable rescalings,…
In this paper we provide formulas for the expectation of a conditional game duration in a finite state-space one-dimensional gambler's ruin problem with arbitrary winning $p(n)$ and losing $q(n)$ probabilities (i.e., they depend on the…
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…
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…
Motivated by the previous results by Coletti-de Lima-Gava-Luiz (2020) and Shiozawa (2022), we study the fluctuation of the dynamic elephant random walk in the superdiffusive case with a strong elephant component. Applying the martingale…