ArticleChaos (Woodbury, N.Y.)2022
Matryoshka and disjoint cluster synchronization of networks.
Article in Chaos (Woodbury, N.Y.), 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
5 citing papers in PubMed.
- Article
- Fibration symmetries and cluster synchronization in the Caenorhabditis elegans connectome.PloS one · 2024Article
- Synchronizing chaos using reservoir computing.Chaos (Woodbury, N.Y.) · 2023Article
- Exact Decomposition of Optimal Control Problems via Simultaneous Block Diagonalization of Matrices.IEEE open journal of control systems · 2023Article
- Algebraic Decomposition of Model Predictive Control Problems.IEEE control systems letters · 2023Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
6 authors.
Funding
Abstract
The main motivation for this paper is to characterize network synchronizability for the case of cluster synchronization (CS), in an analogous fashion to Barahona and Pecora [Phys. Rev. Lett. 89, 054101 (2002)] for the case of complete synchronization. We find this problem to be substantially more complex than the original one. We distinguish between the two cases of networks with intertwined clusters and no intertwined clusters and between the two cases that the master stability function is negative either in a bounded range or in an unbounded range of its argument. Our proposed definition of cluster synchronizability is based on the synchronizability of each individual cluster within a network. We then attempt to generalize this definition to the entire network. For CS, the synchronous solution for each cluster may be stable, independent of the stability of the other clusters, which results in possibly different ranges in which each cluster synchronizes (isolated CS). For each pair of clusters, we distinguish between three different cases: Matryoshka cluster synchronization (when the range of the stability of the synchronous solution for one cluster is included in that of the other cluster), partially disjoint cluster synchronization (when the ranges of stability of the synchronous solutions partially overlap), and complete disjoint cluster synchronization (when the ranges of stability of the synchronous solutions do not overlap).
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.