Characterizing the complexity of time series networks of dynamical systems: A simplicial approach

DOI10.1063/1.5100362zbMath1431.37061arXiv1807.03154OpenAlexW2999973123WikidataQ89512337 ScholiaQ89512337MaRDI QIDQ5218148

N. Nirmal Thyagu, Neelima Gupte, Nithyanand Rao, Malayaja Chutani

Publication date: 28 February 2020

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Time series analysis of dynamical systems (37M10)

Related Items

A new parameter-free entropy based on fragment oscillation and its application in fault diagnosis

Uses Software

• Algorithm 457

Cites Work

• Unnamed Item
• Unnamed Item
• Complex network approach for recurrence analysis of time series
• A two-dimensional mapping with a strange attractor
• Embedology
• \(Q\)-analysis for modeling and decision making
• Hierarchical sequencing of online social graphs
• Recurrence quantification analysis of the logistic equation with transients.
• Simplicial complexes of graphs
• From time series to complex networks: The visibility graph
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Independent coordinates for strange attractors from mutual information
• Symbolic recurrence plots to analyze dynamical systems
• Topological characterization and early detection of bifurcations and chaos in complex systems using persistent homology
• Nonlinear Time Series Analysis
• Persistent topological features of dynamical systems
• Collective dynamics of ‘small-world’ networks
• Algorithm 457: finding all cliques of an undirected graph