Computational Measurements of the Transient Time and of the Sampling Distance That Enables Statistical Independence in the Logistic Map
Details
Serval ID
serval:BIB_C6E415134832
Type
Inproceedings: an article in a conference proceedings.
Collection
Publications
Institution
Title
Computational Measurements of the Transient Time and of the Sampling Distance That Enables Statistical Independence in the Logistic Map
Title of the conference
Lecture Notes in Computer Science: Computational Science and Its Applications – ICCSA
Publisher
Springer-Verlag, Berlin, Heidelberg
ISBN
9783642024566
9783642024573
9783642024573
ISSN
0302-9743
1611-3349
1611-3349
Publication state
Published
Issued date
2009
Peer-reviewed
Oui
Volume
5593
Pages
703-718
Language
english
Abstract
The paper presents an original statistical approach dedicated to the evaluation of two time intervals which are useful in various chaotic applications, namely: the transient time and the minimum statistical independence sampling distance. The overall procedure relies on Smirnov tests based on two-sample statistic, Kolmogorov-Smirnov tests based on one-sample statistic, a Monte Carlo analysis and an original statistical independence test. The experimental study was performed on the logistic map for different values of its parameter, values considered of much interest in the literature. The proposed statistical approach may guide another experimenter to extend the analysis for other logistic map parameters and also for other chaotic maps.
Keywords
statistical independence in chaotic maps, transient time, Kolmo gorov and Smirnov tests, statistical independence test, logistic map
Web of science
Create date
17/11/2021 15:13
Last modification date
15/12/2023 13:14