2016
DOI: 10.1103/physreve.93.032111
|View full text |Cite
|
Sign up to set email alerts
|

Random recursive trees and the elephant random walk

Abstract: One class of random walks with infinite memory, so-called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We use a coupling between the two models to translate results from elephant random walks to the percolation process. We calculate, besides other quantities, exact expressions for the first and the second moment of the root cluster size and of the number of nodes in child clusters… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
65
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 54 publications
(67 citation statements)
references
References 36 publications
2
65
0
Order By: Relevance
“…It is known that globally correlated stochastic dynamics lead to anomalous diffusion processes [27][28][29][30][31][32][33][34][35]. On the other hand, we remark that the interplay between memory effects and weak ergodicity breaking was study previously such as for example in correlated continuous-time random walk models [36,37], single-file diffusion [38], and fractional Brownian-Langevin motion [39].…”
Section: Introductionmentioning
confidence: 62%
See 3 more Smart Citations
“…It is known that globally correlated stochastic dynamics lead to anomalous diffusion processes [27][28][29][30][31][32][33][34][35]. On the other hand, we remark that the interplay between memory effects and weak ergodicity breaking was study previously such as for example in correlated continuous-time random walk models [36,37], single-file diffusion [38], and fractional Brownian-Langevin motion [39].…”
Section: Introductionmentioning
confidence: 62%
“…For alternative memory mechanisms, such as that associated to the elephant random walk model [27][28][29], the previous randomness is absent [46].…”
Section: A Asymptotic Randomnessmentioning
confidence: 99%
See 2 more Smart Citations
“…Both claims in Theorem 3 follow from a straightforward application of Theorem 7 to our random walk. Consider K n := 2un ansn ; then we can verify that lim n→∞ K n = 0 as a consequence of (13), (14), (15) and (16). Therefore, the proof of the result in item a)…”
Section: Law Of the Iterated Logarithmmentioning
confidence: 82%