|
|
|
| Effects of Clustering Coefficient and Degree Distribution on Complexity in Oscillator Networks |
| LI Juexuan1,2, ZHAO Ming1
|
1. College of Physics and Technology, Guangxi Normal University, Guilin 541004, China;
2. Department of Physics and Information Science, Liuzhou Teachers College, Liuzhou 545004, China |
|
|
|
|
Abstract Complexity is defined to describe the partial synchronization state in complex networks, which is sensitive to the network structure, however, how the structure affects the complexity is still unclear. Clustering coefficient and degree distribution are two typical parameters in complex networks. In this paper, the effects of these two parameters on complexity are studied. After careful study it is found that increasing clustering coefficient would increase the maximal complexity and broaden the width of the complexity curves, and increasing the heterogeneity of the degree distribution will increase the value of rising and falling part of complexity curve but have no effect on the maximal complexity. Furthermore, complexity is sensitive to clustering coefficient in small-world networks and sensitive to heterogeneity of degree distribution in scale-free networks. Our work deepens the knowledge of complexity, and provide useful theory to design complex network structure.
|
|
Received: 12 March 2015
Published: 25 February 2025
|
|
|
|
|
|
|
|
|
