2018
DOI: 10.1063/1.5033340
|View full text |Cite
|
Sign up to set email alerts
|

Non-Markovian random walks with memory lapses

Abstract: We propose an approach to construct Bernoulli trials {X i , i ≥ 1} combining dependence and independence periods, and call it Bernoulli sequence with random dependence (BSRD). The structure of dependence, on the past S i = X 1 + . . . + X i , defines a class of non-Markovian random walks of recent interest in the literature. In this paper, the dependence is activated by an auxiliary collection of Bernoulli trials {Y i , i ≥ 1}, called memory switch sequence. We introduce the concept of memory lapses property, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
2
1

Relationship

2
6

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 26 publications
0
9
0
Order By: Relevance
“…In what follows, we present an example of how this diffusion can be seen. It is a version of an application presented in [11] and illustrates a potential application for the random-trend diffusion model. Example 1.…”
Section: The Diffusion Model and Main Resultsmentioning
confidence: 99%
“…In what follows, we present an example of how this diffusion can be seen. It is a version of an application presented in [11] and illustrates a potential application for the random-trend diffusion model. Example 1.…”
Section: The Diffusion Model and Main Resultsmentioning
confidence: 99%
“…When the typical step X has the Rademacher law, i.e. P(X = 1) = P(X = −1) = 1/2, Kürsten [18] (see also [10]) pointed out that Ŝ is a version of the elephant random walk with memory parameter q = (p + 1)/2 in the present notation. When X has a symmetric stable distribution, Ŝ is the so-called shark random swim which has been studied in depth by Businger [6].…”
Section: An Invariance Principle With Reinforcementmentioning
confidence: 89%
“…The angle-bracket M is a continuous strictly increasing bijection from R + to R + a.s., see (10), and we write T for the inverse bijection. We introduce for each n ∈ N the process…”
Section: An Invariance Principle With Reinforcementmentioning
confidence: 99%
“…This is a first step towards a better understanding of situations with a memory increasing in time, and for finding the breaking point for the phase transitions. This is interesting, for example, in connection with the concept of memory lapse [9]. We begin by studying the cases when the walker only remembers the first (two) step(s) or only the most recent steps.…”
Section: Introductionmentioning
confidence: 99%