The Wigner's Semicircle Law of Weighted Random Networks

@article{Sakumoto2020TheWS,
  title={The Wigner's Semicircle Law of Weighted Random Networks},
  author={Yusuke Sakumoto and Masaki Aida},
  journal={IEICE Trans. Commun.},
  year={2020},
  volume={104-B},
  pages={251-261}
}
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… 

Figures from this paper

References

SHOWING 1-10 OF 20 REFERENCES

Spectra of random graphs with given expected degrees

  • F. ChungLinyuan LuV. Vu
  • Mathematics
    Proceedings of the National Academy of Sciences of the United States of America
  • 2003
In the study of the spectra of power-law graphs, there are basically two competing approaches. One is to prove analogues of Wigner's semicircle law, whereas the other predicts that the eigenvalues

The Spectra of Random Graphs with Given Expected Degrees

It is shown that (under certain conditions) the eigenvalues of the (normalized) Laplacian of a random power law graph follow the semicircle law while the spectrum of the adjacency matrix of a power law graphs obeys the power law.

Weighted Spectral Distribution for Internet Topology Analysis: Theory and Applications

A new metric is derived that enables exactly such a structural comparison: the weighted spectral distribution, which is used to quantify the effect of changing the mixing properties of a simple synthetic network generator.

Information Propagation Analysis of Social Network Using the Universality of Random Matrix

The results show that the worst-case speed of the information propagation changes at most 2 if the structure of a social network changes, and the universality of the normalized Laplacian matrix is clarified.

Graph Degree Heterogeneity Facilitates Random Walker Meetings

Various graph algorithms have been developed with multiple random walks, the movement of several independent random walkers on a graph. Designing an efficient graph algorithm based on multiple random

On the Distribution of the Roots of Certain Symmetric Matrices

The distribution law obtained before' for a very special set of matrices is valid for much more general sets of real symmetric matrices of very high dimensionality.

The burden of online friends: The effects of giving up Facebook on stress and well-being

The results suggest that the typical Facebook user may occasionally find the large amount of social information available to be taxing, and Facebook vacations could ameliorate this stress—at least in the short term.

Spectra of weighted scale-free networks

This paper presents a first study on the transition matrix of a family of weight driven networks, whose degree, strength, and edge weight obey power-law distributions, as observed in diverse real networks.