2014
DOI: 10.1007/978-3-319-09144-0_12
|View full text |Cite
|
Sign up to set email alerts
|

Ideal Quantification of Chaos at Finite Resolution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…They introduce a combinatorial representation of discrete-time continuous-space dynamical systems as a graph, and map mathematical properties of dynamical systems such as transitivity and mixing to graph-theoretic properties such as connectivity and aperiodicity. An improvement over such framework from the perspective of computational efficiency is introduced by I. Elshaarawy and W. Gomaa in [6,5]. An essential component in a CPS/IOT system is communication network.…”
Section: Non-rigorous Computationmentioning
confidence: 99%
See 1 more Smart Citation
“…They introduce a combinatorial representation of discrete-time continuous-space dynamical systems as a graph, and map mathematical properties of dynamical systems such as transitivity and mixing to graph-theoretic properties such as connectivity and aperiodicity. An improvement over such framework from the perspective of computational efficiency is introduced by I. Elshaarawy and W. Gomaa in [6,5]. An essential component in a CPS/IOT system is communication network.…”
Section: Non-rigorous Computationmentioning
confidence: 99%
“…Discretized phase space: the dotted rectangle is the exact image and the gray area is the ideal representation of f (P i ))[6] (b) Every node i maps to itself due to the original map behavior, but maps to elements i1 and i + 1 also due to overlapping only.…”
mentioning
confidence: 99%