Spectral centrality measures in complex networks

Abstract

Complex networks are characterized by heterogeneous distributions of the degree of nodes, which produce a large diversification of the roles of the nodes within the network. Several centrality measures have been introduced to rank nodes based on their topological importance within a graph. Here we review and compare centrality measures based on spectral properties of graph matrices. We shall focus on PageRank, eigenvector centrality and the hub/authority scores of HITS. We derive simple relations between the measures and the (in)degree of the nodes, in some limits. We also compare the rankings obtained with different centrality measures.

11 pages, 10 figures, 5 tables. Final version published in Physical Review E

References in corpus (11)

• Emergence of scaling in random networks
• The structure and function of complex networks
• Error and attack tolerance of complex networks
• Epidemic spreading in scale-free networks
• Resilience of the Internet to random breakdowns
• Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
• Subgraph Centrality in Complex Networks
• Spectral Measures of Bipartivity in Complex Networks
• Statistical-mechanical approach to subgraph centrality in complex networks
• The Fractal Properties of Internet
• Random Walks on Directed Networks: the Case of PageRank

Cited by in corpus (26)

• The Kuramoto model in complex networks
• Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
• Laplacian Dynamics and Multiscale Modular Structure in Networks
• Ranking in evolving complex networks
• LinkRank: Finding communities in directed networks
• Visibility of minorities in social networks
• A Learning Convolutional Neural Network Approach for Network Robustness Prediction
• Fast Distributed PageRank Computation
• A Note on the PageRank of Undirected Graphs
• Social Diversity Reduces the Complexity and Cost of Fostering Fairness
• A measure of centrality based on the spectrum of the Laplacian
• Quantum centrality testing on directed graphs via PT-symmetric quantum walks
• Towards Google matrix of brain
• The Homophily Principle in Social Network Analysis
• Multiscale mobility patterns and the restriction of human movement
• PageRank in undirected random graphs
• CNN-based Prediction of Network Robustness With Missing Edges
• Google matrix of business process management
• Centralities in complex networks
• Geometric detection of hierarchical backbones in real networks
• Influence measures in subnetworks using vertex centrality
• Incrementally Updated Spectral Embeddings
• Recognition of Emerging Technology Trends. Class-selective study of citations in the U.S. Patent Citation Network
• Representation Learning of Reconstructed Graphs Using Random Walk Graph Convolutional Network
• Statistics of remote regions of networks
• The Function of Communities in Protein Interaction Networks at Multiple Scales