Principal eigenvector localization and centrality in networks: revisited
arXiv:1909.08696 · doi:10.1016/j.physa.2020.124169
Abstract
Complex networks or graphs provide a powerful framework to understand importance of individuals and their interactions in real-world complex systems. Several graph theoretical measures have been introduced to access importance of the individual in systems represented by networks. Particularly, eigenvector centrality (EC) measure has been very popular due to its ability in measuring importance of the nodes based on not only number of interactions they acquire but also particular structural positions they have in the networks. Furthermore, the presence of certain structural features, such as the existence of high degree nodes in a network is recognized to induce localization transition of the principal eigenvector (PEV) of the network's adjacency matrix. Localization of PEV has been shown to cause difficulties in assigning centrality weights to the nodes based on the EC. We revisit PEV localization and its relation with failure of EC problem, and by using simple model networks demonstrate that in addition to the localization of the PEV, the delocalization of PEV may also create difficulties for using EC as a measure to rank the nodes. Our investigation while providing fundamental insight to the relation between PEV localization and centrality of nodes in networks, suggests that for the networks having delocalized PEVs, it is better to use degree centrality measure to rank the nodes.
arXiv comment13 pages, 7 figures
References in corpus (16)
- Localization and Spreading of Diseases in Complex Networks
- Localization and centrality in networks
- Spectrum of Controlling and Observing Complex Networks
- Synchronization in networks with multiple interaction layers
- Successful strategies for competing networks
- Distinct types of eigenvector localization in networks
- Spectra of random graphs with arbitrary expected degrees
- On the Role of Network Centrality in the Controllability of Complex Networks
- Spectral properties of complex networks
- The Anderson model of localization: a challenge for modern eigenvalue methods
- Centrality metrics and localization in core-periphery networks
- Optimized evolution of networks for principal eigenvector localization
- Topological dimension tunes activity patterns in hierarchical modular network models
- Localization of eigenvector centrality in networks with a cut vertex
- Localization in random bipartite graphs: numerical and empirical study
- From Spectra to Localized Networks: A Reverse Engineering Approach
Cited by in corpus (5)
- Identifying symmetries and predicting cluster synchronization in complex networks
- A greedy algorithm for computing eigenvalues of a symmetric matrix
- From Spectra to Localized Networks: A Reverse Engineering Approach
- Eigenvector localization in hypergraphs: pair-wise vs higher-order links
- Adjustable reach in a network centrality based on current flows