Synchronizability of Highly Clustered Scale-Free Networks

2005/11/28 by Xiang Wu, Bing-Hong Wang, Tao Zhou +5 · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Artificial intelligence #Cluster analysis #Clustering coefficient #Combinatorics #Complex Network Analysis Techniques #Complex network #Computer science #Mathematics #Neural Networks Stability and Synchronization #Nonlinear Dynamics and Pattern Formation #Physics #Scale (ratio) #Scale-free network #Topology (electrical circuits) #cond-mat.dis-nn #cond-mat.stat-mech

paper · pdf · doi:10.1088/0256-307x/23/4/079

published as Chinese Physics Letters 23, 1046(2006) · 4 pages, 5 eps figures

arxiv created 2005/11/28 · openalex publication_date 2006/03/30 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05

Abstract

We consider the effect of clustering coefficient on the synchronizability of coupled oscillators located on scale-free networks. The analytic result for the value of clustering coefficient aiming at a highly clustered scale-free network model, the Holme–Kim model is obtained, and the relationship between network synchronizability and clustering coefficient is reported. The simulation results strongly suggest that the more clustered the network, the poorer the synchronizability.

Citations

• Emergence of scaling in random networks
• Sandpile on Scale-Free Networks
• Epidemic Spreading in Scale-Free Networks
• Statistical mechanics of complex networks
• Evolution of networks
• The Structure and Function of Complex Networks

Cited by

• Optimal tree for both synchronizability and converging time
• Tuning degree distributions: Departing from scale-free networks