2016
DOI: 10.1038/srep38634
|View full text |Cite
|
Sign up to set email alerts
|

Random walk with chaotically driven bias

Abstract: We investigate two types of random walks with a fluctuating probability (bias) in which the random walker jumps to the right. One is a ‘time-quenched framework’ using bias time series such as periodic, quasi-periodic, and chaotic time series (chaotically driven bias). The other is a ‘time-annealed framework’ using the fluctuating bias generated by a stochastic process, which is not quenched in time. We show that the diffusive properties in the time-quenched framework can be characterised by the ensemble averag… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
4
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7

Relationship

4
3

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 26 publications
0
4
0
Order By: Relevance
“…Meanwhile, besides negative autocorrelation inherent in laser chaos, other perspectives could address the underlying mechanism such as diffusivity, 44 Hurst exponents, 45 etc.…”
Section: Discussionmentioning
confidence: 99%
“…Meanwhile, besides negative autocorrelation inherent in laser chaos, other perspectives could address the underlying mechanism such as diffusivity, 44 Hurst exponents, 45 etc.…”
Section: Discussionmentioning
confidence: 99%
“…In this respect, we analysed the diffusivity of the temporal sequences based on the ensemble averages of the time-averaged mean square displacements (ETMSDs) 28 , 29 in the following manner. We first generated a random walker via comparison between the chaotic time series.…”
Section: Discussionmentioning
confidence: 99%
“…This is evident in the fact that people have used objects and natural phenomena to apply randomness in gambling since ancient times [42]. In terms of search methods, for example, some results demonstrate that methods that consider chaos, which is a deterministic phenomenon, give more efficient search results than the method with randomness [43,44]. Certain features of near randomness but not belonging to randomness allow for the creation of special functions, such as efficient search.…”
Section: Discussionmentioning
confidence: 99%