The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A teoria dos grafos espectrais fornece uma abordagem algébrica para investigar as características de redes ponderadas usando os autovalores e autovetores de uma matriz (por exemplo, matriz Laplaciana normalizada) que representa a estrutura da rede. No entanto, é difícil representar com precisão as estruturas de redes complexas e de grande escala (por exemplo, redes sociais) como uma matriz. Esta dificuldade pode ser evitada se houver uma universalidade, tal que os autovalores sejam independentes da estrutura detalhada em redes complexas e de grande escala. Neste artigo, esclarecemos a Lei do Semicírculo de Wigner para redes ponderadas como tal universalidade. A lei indica que os autovalores da matriz Laplaciana normalizada de redes ponderadas podem ser calculados a partir de algumas estatísticas de rede (o grau médio, o peso médio do link e o peso médio quadrado do link) quando as redes ponderadas satisfazem uma condição suficiente dos graus do nó e os pesos dos links.
Yusuke SAKUMOTO
Kwansei Gakuin University
Masaki AIDA
Tokyo Metropolitan University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Yusuke SAKUMOTO, Masaki AIDA, "Wigner's Semicircle Law of Weighted Random Networks" in IEICE TRANSACTIONS on Communications,
vol. E104-B, no. 3, pp. 251-261, March 2021, doi: 10.1587/transcom.2020EBP3051.
Abstract: Spectral graph theory provides an algebraic 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 to accurately represent the structures of large-scale and complex networks (e.g., social network) as a matrix. This difficulty can be avoided if there is a universality, such that the eigenvalues are independent of the detailed structure in large-scale and complex network. In this paper, we clarify Wigner's Semicircle Law for weighted networks as such a universality. The law indicates that the eigenvalues of the normalized Laplacian matrix of weighted networks can be calculated from a few network statistics (the average degree, average link weight, and square average link weight) when the weighted networks satisfy a sufficient condition of the node degrees and the link weights.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2020EBP3051/_p
Copiar
@ARTICLE{e104-b_3_251,
author={Yusuke SAKUMOTO, Masaki AIDA, },
journal={IEICE TRANSACTIONS on Communications},
title={Wigner's Semicircle Law of Weighted Random Networks},
year={2021},
volume={E104-B},
number={3},
pages={251-261},
abstract={Spectral graph theory provides an algebraic 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 to accurately represent the structures of large-scale and complex networks (e.g., social network) as a matrix. This difficulty can be avoided if there is a universality, such that the eigenvalues are independent of the detailed structure in large-scale and complex network. In this paper, we clarify Wigner's Semicircle Law for weighted networks as such a universality. The law indicates that the eigenvalues of the normalized Laplacian matrix of weighted networks can be calculated from a few network statistics (the average degree, average link weight, and square average link weight) when the weighted networks satisfy a sufficient condition of the node degrees and the link weights.},
keywords={},
doi={10.1587/transcom.2020EBP3051},
ISSN={1745-1345},
month={March},}
Copiar
TY - JOUR
TI - Wigner's Semicircle Law of Weighted Random Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 251
EP - 261
AU - Yusuke SAKUMOTO
AU - Masaki AIDA
PY - 2021
DO - 10.1587/transcom.2020EBP3051
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E104-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2021
AB - Spectral graph theory provides an algebraic 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 to accurately represent the structures of large-scale and complex networks (e.g., social network) as a matrix. This difficulty can be avoided if there is a universality, such that the eigenvalues are independent of the detailed structure in large-scale and complex network. In this paper, we clarify Wigner's Semicircle Law for weighted networks as such a universality. The law indicates that the eigenvalues of the normalized Laplacian matrix of weighted networks can be calculated from a few network statistics (the average degree, average link weight, and square average link weight) when the weighted networks satisfy a sufficient condition of the node degrees and the link weights.
ER -