Localization of eigenvector centrality in networks with a cut vertex

Abstract

We show that eigenvector centrality exhibits localization phenomena on networks that can be easily partitioned by the removal of a vertex cut set, the most extreme example being networks with a cut vertex. Three distinct types of localization are identified in these structures. One is related to the well-established hub node localization phenomenon and the other two are introduced and characterized here. We gain insights into these problems by deriving the relationship between eigenvector centrality and Katz centrality. This leads to an interpretation of the principal eigenvector as an approximation to more robust centrality measures which exist in the full span of an eigenbasis of the adjacency matrix.

References in corpus (12)

• The structure and function of complex networks
• Cooperative Game Theory Approaches for Network Partitioning
• Spectral redemption: clustering sparse networks
• Localization and Spreading of Diseases in Complex Networks
• Localization and centrality in networks
• Spectra and eigenvectors of scale-free networks
• Modularity and Extreme Edges of the Internet
• On the limiting behavior of parameter-dependent network centrality measures
• Distinct types of eigenvector localization in networks
• Networks in life: Scaling properties and eigenvalue spectra
• Random matrices, non-backtracking walks, and orthogonal polynomials
• A control analysis perspective on Katz centrality

Cited by in corpus (6)

• Master equation analysis of mesoscopic localization in contagion dynamics on higher-order networks
• Principal eigenvector localization and centrality in networks: revisited
• Nonlocal PageRank
• Finding the Resistance Distance and Eigenvector Centrality from the Network's Eigenvalues
• Community Detection via Katz and Eigenvector Centrality
• Wheel graph strategy for PEV localization of networks