How complex a dynamical network can be?
From MaRDI portal
Publication:432902
Recommendations
Cites work
- scientific article; zbMATH DE number 3140804 (Why is no real title available?)
- scientific article; zbMATH DE number 3062467 (Why is no real title available?)
- A proof of the estimation from below in Pesin's entropy formula
- An inequality for the entropy of differentiable maps
- CHARACTERISTIC LYAPUNOV EXPONENTS AND SMOOTH ERGODIC THEORY
- Chemical oscillations, waves, and turbulence
- Lyapunov exponents of a lattice of chaotic maps with a power-law coupling
- What are SRB measures, and which dynamical systems have them?
Cited in
(4)- Small-world networks exhibit pronounced intermittent synchronization
- FUNDAMENTALS OF A CLASSICAL CHAOS-BASED CRYPTOSYSTEM WITH SOME QUANTUM CRYPTOGRAPHY FEATURES
- Response of Lyapunov exponents to diffusion state of biological networks
- Complexity functions for networks: dynamical hubs and complexity clusters
This page was built for publication: How complex a dynamical network can be?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q432902)