2014
DOI: 10.1007/s11071-014-1764-8
|View full text |Cite
|
Sign up to set email alerts
|

Complete synchronization and delayed synchronization in couplings

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
8
1

Relationship

3
6

Authors

Journals

citations
Cited by 16 publications
(7 citation statements)
references
References 12 publications
0
7
0
Order By: Relevance
“…At present, the main control methods to achieve synchronization have drive-response control [ 31 36 ], feedback control [ 37 ], adaptive control [ 38 ], impulsive control [ 39 ], intermittent control [ 40 ], sliding control [ 41 ] and pinning control [ 42 ]. And the synchronization forms mainly include complete synchronization [ 43 , 44 ], lag synchronization [ 45 47 ], generalized synchronization [ 48 , 49 ], etc [ 50 , 51 ].…”
Section: Introductionmentioning
confidence: 99%
“…At present, the main control methods to achieve synchronization have drive-response control [ 31 36 ], feedback control [ 37 ], adaptive control [ 38 ], impulsive control [ 39 ], intermittent control [ 40 ], sliding control [ 41 ] and pinning control [ 42 ]. And the synchronization forms mainly include complete synchronization [ 43 , 44 ], lag synchronization [ 45 47 ], generalized synchronization [ 48 , 49 ], etc [ 50 , 51 ].…”
Section: Introductionmentioning
confidence: 99%
“…n > −2e −h and FCW reduces to We note that for a network satisfying the conditions of any of the these propositions in order to be full-commandable, the smallest commanding coupling constant is ǫ = 1 − e −h , a value that does not depend on the structure of the network, it only depends on the dynamic of the nodes. This value is exactly the same that it is needed in a one-way linear coupling for a dynamical system to command the other one [17]. Further, a completely connected network is as more resistant to a full-command as greater is the network (i.e., as greater is n) and as stronger are the connections between the dynamical systems (i.e., as greater is c).…”
Section: Proposition 3 Considering a Network (1) Such That A Is Diagomentioning
confidence: 87%
“…In fact, since = 0 is an eigenvalue of the coupling matrix A, corresponding to the eigenvector − → 1 , we have Adding a new identical dynamical system, y, to the network, we want to analyze the possibility that, after a transient period, this new node imposes its iterates to all the others. In a coupling, we obtain that using a one-way connection with a coupling strength greater than 1 − e −h , where h is the Lyapunov exponent of the coupled systems [17]. So, we consider that the new node is one-way connected to all nodes of the network, i.e., we consider the new network…”
Section: Introductionmentioning
confidence: 99%
“…In these figures, we can see the values of c for which within a chaotic trajectory s(t). For more details, see [6].…”
Section: Chaotic Windowsmentioning
confidence: 99%