High density nodes in the Chaotic region of 1D discrete maps

George Livadiotis

doi:10.3390/e20010024

High density nodes in the Chaotic region of 1D discrete maps

George Livadiotis

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

We report on the definition and characteristics of nodes in the chaotic region of bifurcation diagrams in the case of 1D mono-parametrical and S-unimodal maps, using as guiding example the logistic map. We examine the arrangement of critical curves, the identification and arrangement of nodes, and the connection between the periodic windows and nodes in the chaotic zone. We finally present several characteristic features of nodes, which involve their convergence and entropy.

Original language	English (US)
Article number	24
Journal	Entropy
Volume	20
Issue number	1
DOIs	https://doi.org/10.3390/e20010024
State	Published - Jan 1 2018
Externally published	Yes

All Science Journal Classification (ASJC) codes

Information Systems
Mathematical Physics
Physics and Astronomy (miscellaneous)
General Physics and Astronomy
Electrical and Electronic Engineering

Keywords

Bifurcation
Chaos
Critical lines
Entropy
Feigenbaum constant
Logistic map
Nodes

Access to Document

10.3390/e20010024

Cite this

@article{4dcecf41e415437890b92e7753007607,

title = "High density nodes in the Chaotic region of 1D discrete maps",

abstract = "We report on the definition and characteristics of nodes in the chaotic region of bifurcation diagrams in the case of 1D mono-parametrical and S-unimodal maps, using as guiding example the logistic map. We examine the arrangement of critical curves, the identification and arrangement of nodes, and the connection between the periodic windows and nodes in the chaotic zone. We finally present several characteristic features of nodes, which involve their convergence and entropy.",

keywords = "Bifurcation, Chaos, Critical lines, Entropy, Feigenbaum constant, Logistic map, Nodes",

author = "George Livadiotis",

note = "Publisher Copyright: {\textcopyright} 2018 by the authors.",

year = "2018",

month = jan,

day = "1",

doi = "10.3390/e20010024",

language = "English (US)",

volume = "20",

journal = "Entropy",

issn = "1099-4300",

publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",

number = "1",

}

TY - JOUR

T1 - High density nodes in the Chaotic region of 1D discrete maps

AU - Livadiotis, George

PY - 2018/1/1

Y1 - 2018/1/1

N2 - We report on the definition and characteristics of nodes in the chaotic region of bifurcation diagrams in the case of 1D mono-parametrical and S-unimodal maps, using as guiding example the logistic map. We examine the arrangement of critical curves, the identification and arrangement of nodes, and the connection between the periodic windows and nodes in the chaotic zone. We finally present several characteristic features of nodes, which involve their convergence and entropy.

AB - We report on the definition and characteristics of nodes in the chaotic region of bifurcation diagrams in the case of 1D mono-parametrical and S-unimodal maps, using as guiding example the logistic map. We examine the arrangement of critical curves, the identification and arrangement of nodes, and the connection between the periodic windows and nodes in the chaotic zone. We finally present several characteristic features of nodes, which involve their convergence and entropy.

KW - Bifurcation

KW - Chaos

KW - Critical lines

KW - Entropy

KW - Feigenbaum constant

KW - Logistic map

KW - Nodes

UR - http://www.scopus.com/inward/record.url?scp=85040624849&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85040624849&partnerID=8YFLogxK

U2 - 10.3390/e20010024

DO - 10.3390/e20010024

M3 - Article

C2 - 33265118

AN - SCOPUS:85040624849

SN - 1099-4300

VL - 20

JO - Entropy

JF - Entropy

IS - 1

M1 - 24

ER -

High density nodes in the Chaotic region of 1D discrete maps

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this