2009
DOI: 10.1103/physreve.79.045101
|View full text |Cite
|
Sign up to set email alerts
|

Synchronization with on-off coupling: Role of time scales in network dynamics

Abstract: We consider the problem of synchronizing a general complex network by means of the on-off coupling strategy; in this case, the on-off time scale is varied from a very small to a very large value. In particular, we find that when the time scale is comparable to that of node dynamics, synchronization can also be achieved and greatly optimized for the upper bound of the stability region which nearly disappears, and the synchronization speed is accelerated a lot, independent of network topologies. Our study indica… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
66
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 77 publications
(67 citation statements)
references
References 20 publications
1
66
0
Order By: Relevance
“…The theoretical result proposed in Corollary 1 is valid for both the fast switching case and the slow switching case. Therefore, our results provide a direct analytical explanation for the synchronization observed in recent numerical simulations of network synchronization without time delays [36,37]. The results in this paper complement and extend existing results.…”
Section: Corollary 1 Suppose That H(x) = X and The Function F (X) Sasupporting
confidence: 89%
See 3 more Smart Citations
“…The theoretical result proposed in Corollary 1 is valid for both the fast switching case and the slow switching case. Therefore, our results provide a direct analytical explanation for the synchronization observed in recent numerical simulations of network synchronization without time delays [36,37]. The results in this paper complement and extend existing results.…”
Section: Corollary 1 Suppose That H(x) = X and The Function F (X) Sasupporting
confidence: 89%
“…[36,37] only for the fast switching case. The theoretical result proposed in Corollary 1 is valid for both the fast switching case and the slow switching case.…”
Section: Corollary 1 Suppose That H(x) = X and The Function F (X) Samentioning
confidence: 98%
See 2 more Smart Citations
“…In [9], it has been found that, for ensembles of yeast transcriptional network, those with deterministic Boolean rules are remarkably stable and those with random Boolean rules are only marginally stable. For various complex/neural/biological networks with deterministic switching topologies, we refer the readers to [2], [5], [30], and [35] for some representative publications.…”
mentioning
confidence: 99%