DeepAI AI Chat
Log In Sign Up

The Wigner's Semicircle Law of Weighted Random Networks

03/31/2020
by   Yusuke Sakumoto, et al.
Tokyo Metropolitan University
Kwansei Gakuin University
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/20/2019

Eigenvalues and Spectral Dimension of Random Geometric Graphs in Thermodynamic Regime

Network geometries are typically characterized by having a finite spectr...
01/12/2023

Spectral properties of the Laplacian of temporal networks following a constant block Jacobi model

We study the behavior of the eigenvectors associated with the smallest e...
10/20/2019

Spectral bounds of the regularized normalized Laplacian for random geometric graphs

In this work, we study the spectrum of the regularized normalized Laplac...
02/09/2018

Estimating the Spectral Density of Large Implicit Matrices

Many important problems are characterized by the eigenvalues of a large ...
07/28/2016

Limit theorems for eigenvectors of the normalized Laplacian for random graphs

We prove a central limit theorem for the components of the eigenvectors ...
01/06/2008

Batch kernel SOM and related Laplacian methods for social network analysis

Large graphs are natural mathematical models for describing the structur...
09/14/2017

Extended corona product as an exactly tractable model for weighted heterogeneous networks

Various graph products and operations have been widely used to construct...