The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Sufficient Conditions for Fast Switching Synchronization in Time-Varying Network Topologies
Open accessAbstract
In previous work [J. D. Skufca and E. Bollt, Mathematical Biosciences and Engineering, 1 (2004), pp. 347-359], empirical evidence indicated that a time-varying network could propagate sufficient information to allow synchronization of the sometimes coupled oscillators, despite an instantaneously disconnected topology. We prove here that if the network of oscillators synchronizes for the static time-average of the topology, then the network will synchronize with the time-varying topology if the time-average is achieved sufficiently fast. Fast switching, fast on the time-scale of the coupled oscillators, overcomes the desynchronizing decoherence suggested by disconnected instantaneous networks. This result agrees in spirit with that of [J. D. Skufca and E. Bollt, Mathematical Biosciences and Engineering, 1 (2004), pp. 347-359] where empirical evidence suggested that a moving averaged graph Laplacian could be used in the master-stability function analysis [L. M. Pecora and T. L. Carroll, Phys. Rev. Lett., 80 (1998), pp. 2109-2112]. A new fast switching stability criterion herein gives sufficiency of a fast switching network leading to synchronization. Although this sufficient condition appears to be very conservative, it provides new insights about the requirements for synchronization when the network topology is time-varying. In particular, it can be shown that networks of oscillators can synchronize even if at every point in time the frozen-time network topology is insufficiently connected to achieve synchronization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Synchronization in chaotic systems
Pecora, L. M., & Carroll, T. L. (1990) · Physical Review Letters · doi:10.1103/physrevlett.64.821 · Cited by 10,625
Chemical Oscillations, Waves, and Turbulence
Kuramoto, Y. (1984) · Springer Series in Synergetics · doi:10.1007/978-3-642-69689-3 · Cited by 7,142
Switching in Systems and Control
Liberzon, D. (2003) · Systems & Control: Foundations & Applications · doi:10.1007/978-1-4612-0017-8 · Cited by 7,023
Synchronization a universal concept in nonlinear sciences
PIKOVSKY, A. S., Rosenblum, M. G., & Kurths, J. (2001) · Cited by 5,640
Differential Equations with Discontinuous Righthand Sides
Filippov, A. F. (1988) · Mathematics and Its Applications · doi:10.1007/978-94-015-7793-9 · Cited by 4,720
Information Flow and Cooperative Control of Vehicle Formations
Fax, J. A., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834433 · Cited by 4,579
Basic problems in stability and design of switched systems
(1999) · IEEE Control Systems · doi:10.1109/37.793443 · Cited by 3,635
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Cited by
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
The structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125
“In particular, a widely studied case is the limit of the so-called blinking networks [378,379], where the switching between different configurations happens rapidly, i.”
BackgroundOscillators that sync and swarm
O’Keeffe, K. P., Hong, H., & Strogatz, S. H. (2017) · Nature Communications · doi:10.1038/s41467-017-01190-3 · Cited by 368
The structure and dynamics of networks with higher order interactions
Boccaletti, S., De Lellis, P., del Genio, C. I., Alfaro-Bittner, K., Criado, R., Jalan, S., & Romance, M. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.04.002 · Cited by 364
Stability of synchronization in simplicial complexes
Gambuzza, L. V., Di Patti, F., Gallo, L., Lepri, S., Romance, M., Criado, R., Frasca, M., Latora, V., & Boccaletti, S. (2021) · Nature Communications · doi:10.1038/s41467-021-21486-9 · Cited by 344
Tracking and formation control of multiple autonomous agents: A two-level consensus approach
Porfiri, M., Roberson, D. G., & Stilwell, D. J. (2007) · Automatica · doi:10.1016/j.automatica.2007.01.004 · Cited by 327
Self-citationCluster Synchronization in Directed Networks Via Intermittent Pinning Control
Liu, X., & Chen, T. (2011) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2011.2139224 · Cited by 318
Zhao, J., Hill, D. J., & Liu, T. (2009) · Automatica · doi:10.1016/j.automatica.2009.07.013 · Cited by 313
Consensus Seeking Over Random Weighted Directed Graphs
Porfiri, M., & Stilwell, D. J. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.904603 · Cited by 301
Self-citation
Metadata
- Authors
- Stilwell, D. J., Bollt, E. M., & Roberson, D. G.
- Venue
- SIAM Journal on Applied Dynamical Systems
- Published
- 2006-01
- Volume
- 5
- Issue
- 1
- Pages
- 140-156
- ISSN
- 1536-0040 (ISSN-L)
- OpenAlex
- W2053769764
- Cited by
- 363
- References
- 50
- FWCI
- 24.78
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.