2012
DOI: 10.1063/1.4705088
|View full text |Cite
|
Sign up to set email alerts
|

Generalized complexity measures and chaotic maps

Abstract: The logistic and Tinkerbell maps are studied with the recently introduced generalized complexity measure. The generalized complexity detects periodic windows. Moreover, it recognizes the intersection of periodic branches of the bifurcation diagram. It also reflects the fractal character of the chaotic dynamics. There are cases where the complexity plot shows changes that cannot be seen in the bifurcation diagram.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(8 citation statements)
references
References 13 publications
0
8
0
Order By: Relevance
“…It is difficult to proof these theorems for non integral values of α and β. For positive real values of α and β, near continuous property can be verified by counter examples of density functions, such as step function and uniform density function [32][33][34][35][36]38 and so on.…”
Section: B Main Theorems For Near Continuous Property Of the Rényi Co...mentioning
confidence: 95%
See 2 more Smart Citations
“…It is difficult to proof these theorems for non integral values of α and β. For positive real values of α and β, near continuous property can be verified by counter examples of density functions, such as step function and uniform density function [32][33][34][35][36]38 and so on.…”
Section: B Main Theorems For Near Continuous Property Of the Rényi Co...mentioning
confidence: 95%
“…For two identical density functions (ρ, ρ), the Rényi complexity ratio C (α,β) (ρ,ρ) reduces to generalized Rényi complexity of ρ. It is denoted by C (α,β) and defined by [32][33][34][35][36]…”
Section: E Generalized Rényi Complexity and Shape Rényi Complexitymentioning
confidence: 99%
See 1 more Smart Citation
“…The RCR Cρραβ is called GRC of order (),αβ. It is denoted by Cαβ and defined by [32–36] Cαβ=Cρραβ=eραρβ,0.25emα,0.25emβ>0. …”
Section: Rényi Complexity Ratiomentioning
confidence: 99%
“…First, some simple quantum systems (H-atom, harmonic oscillator and square well) were studied with these measures. Recently, it has been demonstrated [3] that these generalized complexity measures are suitable to describe chaotic behavior. The logistic and Tinkerbell maps were analyzed.…”
Section: Introductionmentioning
confidence: 99%