The Wigner's Semicircle Law of Weighted Random Networks

The spectral graph theory provides an algebraical approach to investigate the characteristics of weighted networks using the eigenvalues and eigenvectors of a matrix (e.g., normalized Laplacian matrix) that represents the structure of the network. However, it is difficult for large-scale and complex networks (e.g., social network) to represent their structure as a matrix correctly. If there is a universality that the eigenvalues are independent of the detailed structure in large-scale and complex network, we can avoid the difficulty. In this paper, we clarify the Wigner's Semicircle Law for weighted networks as such a universality. The law indicates that the eigenvalues of the normalized Laplacian matrix for weighted networks can be calculated from the a few network statistics (the average degree, the average link weight, and the square average link weight) when the weighted networks satisfy the sufficient condition of the node degrees and the link weights.

[1]  Fan Chung Graham,et al.  The Spectra of Random Graphs with Given Expected Degrees , 2004, Internet Math..

[2]  Miguel Rio,et al.  Weighted Spectral Distribution for Internet Topology Analysis: Theory and Applications , 2010, IEEE/ACM Transactions on Networking.

[3]  Y. Sakumoto,et al.  Graph Degree Heterogeneity Facilitates Random Walker Meetings , 2020, IEICE Trans. Commun..

[4]  Philip S. Yu,et al.  A Survey of Heterogeneous Information Network Analysis , 2015, IEEE Transactions on Knowledge and Data Engineering.

[5]  E. Wigner.  On the Distribution of the Roots of Certain Symmetric Matrices , 1958 .

[6]  Gang Lu,et al.  Accurately and quickly calculating the weighted spectral distribution , 2015, Telecommunication Systems.

[7]  Jia Feng,et al.  Weighted complex network analysis of the Beijing subway system: Train and passenger flows , 2017 .

[8]  V. Plerou,et al.  Random matrix approach to cross correlations in financial data. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  F. Chung,et al.  Spectra of random graphs with given expected degrees , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Masaki Aida,et al.  Information Propagation Analysis of Social Network Using the Universality of Random Matrix , 2017, IEICE Trans. Commun..

[11]  Zhongzhi Zhang,et al.  Spectra of weighted scale-free networks , 2015, Scientific Reports.

[12]  Lars Backstrom,et al.  The Anatomy of the Facebook Social Graph , 2011, ArXiv.

[13]  Daniel A. Spielman,et al.  Spectral Graph Theory and its Applications , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[14]  Andrew W. Moore,et al.  Weighted spectral distribution , 2008 .

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

[16]  Stephanie J Tobin,et al.  The burden of online friends: The effects of giving up Facebook on stress and well-being , 2018, The Journal of social psychology.

[17]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[18]  Volker Gollnick,et al.  Robustness analysis metrics for worldwide airport network: A comprehensive study , 2017 .

[19]  Minas Gjoka,et al.  Practical Recommendations on Crawling Online Social Networks , 2011, IEEE Journal on Selected Areas in Communications.