Optimal synchronizability of complex dynamical networks

Author

Kun, Dai ; Xiaofan, Wang

Author_Institution

Dept. of Autom., Shanghai Jiao Tong Univ., Shanghai

fYear

2008

fDate

16-18 July 2008

Firstpage

338

Lastpage

342

Abstract

In this paper, we propose an eigenvector criterion for achieving optimal synchronizability in a dynamical network. Two synchronization-optimal small-world (SOSW) models are generated by adding or rewiring edges from a nearest-neighbor coupled regular network according to the eigenvector criterion. We find that networks having very similar topology characteristics may have different synchronizability which reveals the complexity of the relationship between synchronizability and structure topologies of complex networks.

Keywords

complex networks; eigenvalues and eigenfunctions; network theory (graphs); synchronisation; topology; complex dynamical networks; eigenvector criterion; nearest-neighbor coupled regular network; optimal synchronizability; synchronization-optimal small-world models; topology characteristics; Automation; Complex networks; Couplings; Eigenvalues and eigenfunctions; Electronic mail; Network topology; Optimal control; Optimization methods; Social network services; Symmetric matrices; Eigenvector Criterion; Small-World Network; Synchronizability;

fLanguage

English

Publisher

ieee

Conference_Titel

Control Conference, 2008. CCC 2008. 27th Chinese

Conference_Location

Kunming

Print_ISBN

978-7-900719-70-6

Electronic_ISBN

978-7-900719-70-6

Type

conf

DOI

10.1109/CHICC.2008.4605643

Filename

4605643