2006
DOI: 10.1016/j.physd.2006.09.016
|View full text |Cite
|
Sign up to set email alerts
|

Random talk: Random walk and synchronizability in a moving neighborhood network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
95
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 122 publications
(97 citation statements)
references
References 29 publications
2
95
0
Order By: Relevance
“…Future efforts will be devoted to investigate the upper bound of degree d y and d θ to ensure the robust synchronization. In addition, particular interests have casted on stochastic synchronization with randomly switching topology, like representative stochastic models used in [15], [16], [18].…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Future efforts will be devoted to investigate the upper bound of degree d y and d θ to ensure the robust synchronization. In addition, particular interests have casted on stochastic synchronization with randomly switching topology, like representative stochastic models used in [15], [16], [18].…”
Section: Discussionmentioning
confidence: 99%
“…In [15], a connection graph stability method, also proposed by [20], is extended to a blinking model of small-world network in which both fixed 2K-nearest neighbor coupling and time-dependent on-off coupling are considered. In [16], each agent is assumed to be a random walker and random changes of network can be described by the change of agents' locations in the lattice where information can be transmitted only for agents in the same lattice. In [17], sufficient conditions are proposed for global synchronization with a fast and random switching network by using stochastic Lyapunov stability theory.…”
Section: Introductionmentioning
confidence: 99%
“…In particular, in [24] adaptive coupling was used to design communication channels able to compensate for parameter changes, while in [25] it was demonstrated that in a synchronization scheme where two Chua's circuits are pulse coupled, the switching frequency has to be larger than a threshold value to achieve synchronization. This behavior is now grounded on recent theoretical results for blinking networks [26,27], proving that under an assumption referred to as the fast switching hypothesis (FSH), when the link changes occur enough faster than the oscillator dynamics, the time-varying coupling can be studied by means of the time-average of the coupling matrix.…”
Section: Introductionmentioning
confidence: 89%
“…the number of oscillators that are around i within a range d. When the agents move fast enough and the network topology changes very fast, we can apply the FSA [17,18,19,20], which consists in replacing the entries in the connectivity matrix in Eq. (3) by its time average.…”
Section: Model Settingsmentioning
confidence: 99%
“…On the one hand, when the network topology changes in a fast manner, a good approximation is to consider a network where the connections are represented by the probability of pairs of agents being connected. This is the so-called fast-switching approximation (FSA) [17,18,19,20]. On the other hand, when the population of agents is dense and arranged in a ring, the Fokker-Planck equation formalism has been used to describe the synchronization transition and the emergence of a spatial structure [21].…”
Section: Introductionmentioning
confidence: 99%