2019
DOI: 10.1080/10236198.2019.1619714
|View full text |Cite
|
Sign up to set email alerts
|

Visibility graphs of fractional Wu–Baleanu time series

Abstract: We study time series generated by the parametric family of fractional discrete maps introduced by Wu and Baleanu in [34], presenting an alternative way of introducing these maps. For the values of the parameters that yield chaotic time series, we have studied the Shannon entropy of the degree distribution of the natural and horizontal visibility graphs associated to these series. In these cases, the degree distribution can be fitted with a power law. We have also compared the Shannon entropy and the exponent o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
14
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 14 publications
(15 citation statements)
references
References 31 publications
(46 reference statements)
1
14
0
Order By: Relevance
“…We have seen that both the scaling factor and the fractional exponent are linked when chaos is present with these results [CLMIR19].…”
Section: Shannon Entropy Of the Visibility Graphssupporting
confidence: 61%
See 3 more Smart Citations
“…We have seen that both the scaling factor and the fractional exponent are linked when chaos is present with these results [CLMIR19].…”
Section: Shannon Entropy Of the Visibility Graphssupporting
confidence: 61%
“…In the fourth column of Table 3.1 the dierent correlations dened in [INL18] have been computed between the NVG's entropy matrix and the power law exponent tting matrix. As it happened with both visibility graphs matrices, the correlations are high in all the cases, meaning that the chaos-related information encoded by the exponent of the power law tting is qualitatively the same as within the entropy of the NVG's [CLMIR19].…”
Section: Visibility Graphs Analysismentioning
confidence: 71%
See 2 more Smart Citations
“…It is remarkable that Volterra difference equations in the form () appears very recently in discrete chaos 16,17 and in the analysis of discrete time neural networks. [ 18 , Formula (10)] In such cases, boldafalse(nfalse)=kμfalse(nfalse):=normalΓfalse(n+μfalse)normalΓfalse(μfalse)n! are the Cesáro numbers 14 .…”
Section: Introductionmentioning
confidence: 99%