Quantifying information loss on chaotic attractors through recurrence networks

DOI10.1016/j.physleta.2019.125854zbMath1481.37036arXiv1908.04731OpenAlexW2969020284MaRDI QIDQ2232469

K. P. Harikrishnan, R. Misra, G. Ambika

Publication date: 5 October 2021

Published in: Physics Letters. A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.04731

zbMATH Keywords

chaotic attractorsnetwork entropyrecurrence networks

Mathematics Subject Classification ID

Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Measures of information, entropy (94A17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complex network approach for recurrence analysis of time series
• A history of graph entropy measures
• Measuring the strangeness of strange attractors
• Characterization of chaotic attractors under noise: a recurrence network perspective
• RECURRENCE-BASED TIME SERIES ANALYSIS BY MEANS OF COMPLEX NETWORK METHODS
• Recurrence networks—a novel paradigm for nonlinear time series analysis
• Superfamily phenomena and motifs of networks induced from time series
• From time series to complex networks: The visibility graph
• The Structure and Function of Complex Networks
• Weighted recurrence networks for the analysis of time-series data
• Exploring complex networks
• The geometry of chaotic dynamics --- a complex network perspective

This page was built for publication: Quantifying information loss on chaotic attractors through recurrence networks