Volume 101, Number 6, March 2013
|Number of page(s)||6|
|Published online||29 March 2013|
Growing highly synchronizable scale-free networks
Department of Computer Engineering, Sharif University of Technology - Tehran, Iran
(a) Present address: Sharif University of Technology - Azadi Av., Tehran, Iran; firstname.lastname@example.org
Received: 24 December 2012
Accepted: 26 February 2013
In this letter, a model for growing highly synchronizable networks is introduced. The model is based on preferential attachment in which the new nodes tip to old ones in a way to maximize the synchronization properties of the network. Criteria based on the eigenvectors corresponding to the second smallest and the largest eigenvalues of the Laplacian matrix of the connection graph were used to choose the old nodes to which a new node makes connection. Numerical simulations showed that these networks have considerably lower eigenratio (the largest eigenvalue of the Laplacian divided by the second smallest one), and hence better synchronizability, as compared to standard Barabási-Albert (BA) scale-free networks. These two models were also different in their statistical properties. BA networks demonstrated larger global and local efficiency, while modularity and assortativity of highly synchronizable networks were larger. The proposed model resulted in networks with almost power-law degree distribution (except an exponential start). Furthermore, the hub nodes in these networks had much smaller degree as compared to those of BA networks.
PACS: 05.45.Xt – Synchronization; coupled oscillators / 89.75.-k – Complex systems / 64.60.aq – Networks
© EPLA, 2013
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.