All-to-all chaos synchronization in a network of networks: One of the simplest cases
classification
🌊 nlin.CD
keywords
synchronizationcaseschaosnetworknetworkssimplestachievingall-
read the original abstract
We report on all- to- all chaos synchronization in a network of networks based on the Ikeda model. We consider one of the simplest cases. We find the existence and stability conditions for such a synchronization regime. Numerical simulations validate the analytical findings. The results can be of certain importance in achieving high level output for the coupled systems and information processing.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.