Localization of Laplacian eigenvectors on random networks

Abstract In large random networks, each eigenvector of the Laplacian matrix tends to localize on a subset of network nodes having similar numbers of edges, namely, the components of each Laplacian eigenvector take relatively large values only on a particular subset of nodes whose degrees are close....

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Shigefumi Hata, Hiroya Nakao
Formato: article
Lenguaje:EN
Publicado: Nature Portfolio 2017
Materias:
R
Q
Acceso en línea:https://doaj.org/article/3b61cac4c4914fafa2a343c00f7453b7
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!