Coarse Graining Method Based on Noded Similarity in Complex Network

Coarse graining of complex networks is an important method to study large-scale complex networks, and is also in the focus of network science today. This paper tries to develop a new coarse-graining method for complex networks, which is based on the node similarity index. From the information structure of the network node similarity, the coarse-grained network is extracted by defining the local similarity and the global similarity index of nodes. A large number of simulation experiments show that the proposed method can effectively reduce the size of the network, while maintaining some statistical properties of the original network to some extent. Moreover, the proposed method has low computational complexity and allows people to freely choose the size of the reduced networks.

[1]  Wei Xing Zheng,et al.  Exponential Synchronization of Complex Networks of Linear Systems and Nonlinear Oscillators: A Unified Analysis , 2015, IEEE Transactions on Neural Networks and Learning Systems.

[2]  Beom Jun Kim.  Geographical coarse graining of complex networks. , 2004, Physical review letters.

[3]  K-I Goh,et al.  Skeleton and fractal scaling in complex networks. , 2006, Physical review letters.

[4]  David Gfeller,et al.  Spectral coarse graining of complex networks. , 2007, Physical review letters.

[5]  Michael Chertkov,et al.  Synchronization in complex oscillator networks and smart grids , 2012, Proceedings of the National Academy of Sciences.

[6]  Zhou Jian,et al.  Improved algorithm of spectral coarse graining method of complex network , 2017 .

[7]  Pan Zao-Feng,et al.  A weighted scale-free network model with large-scale tunable clustering , 2006 .

[8]  Guanrong Chen,et al.  Synchronizability of small-world networks generated from ring networks with equal-distance edge additions. , 2012, Chaos.

[9]  Linyuan Lü,et al.  Coarse graining for synchronization in directed networks. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[11]  Zhen Jia,et al.  Coarse graining method based on generalized degree in complex network , 2018, Physica A: Statistical Mechanics and its Applications.

[12]  David Gfeller,et al.  Spectral coarse graining and synchronization in oscillator networks. , 2007, Physical review letters.

[13]  Yijing Yan,et al.  Statistically consistent coarse-grained simulations for critical phenomena in complex networks. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Pei Wang,et al.  Coarse graining of complex networks: A k-means clustering approach , 2016, 2016 Chinese Control and Decision Conference (CCDC).

[15]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[16]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[17]  Tao Zhou,et al.  Better synchronizability predicted by crossed double cycle. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Alessandro Vespignani,et al.  k-core decomposition: a tool for the analysis of large scale Internet graphs , 2005, ArXiv.

[19]  S. Havlin,et al.  Self-similarity of complex networks , 2005, Nature.

[20]  Z. Di,et al.  Spectral coarse graining for random walks in bipartite networks. , 2012, Chaos.