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....
Saved in:
| Main Authors: | , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Nature Portfolio
2017
|
| Subjects: | |
| Online Access: | https://doaj.org/article/3b61cac4c4914fafa2a343c00f7453b7 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|