Centrality metrics and localization in core-periphery networks
arXiv:1510.01116 · doi:10.1088/1742-5468/2016/02/023401
Abstract
Two concepts of centrality have been defined in complex networks. The first considers the centrality of a node and many different metrics for it has been defined (e.g. eigenvector centrality, PageRank, non-backtracking centrality, etc). The second is related to a large scale organization of the network, the core-periphery structure, composed by a dense core plus an outlying and loosely-connected periphery. In this paper we investigate the relation between these two concepts. We consider networks generated via the Stochastic Block Model, or its degree corrected version, with a strong core-periphery structure and we investigate the centrality properties of the core nodes and the ability of several centrality metrics to identify them. We find that the three measures with the best performance are marginals obtained with belief propagation, PageRank, and degree centrality, while non-backtracking and eigenvector centrality (or MINRES}, showed to be equivalent to the latter in the large network limit) perform worse in the investigated networks.
arXiv comment15 pages, 8 figures
References in corpus (18)
- Emergence of scaling in random networks
- Epidemic spreading in scale-free networks
- Catastrophic cascade of failures in interdependent networks
- Random graphs with arbitrary degree distributions and their applications
- Stochastic blockmodels and community structure in networks
- Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
- Spectral redemption: clustering sparse networks
- Spectra of "Real-World" Graphs: Beyond the Semi-Circle Law
- Phase transition in the detection of modules in sparse networks
- Graph spectra and the detectability of community structure in networks
- Localization and centrality in networks
- Core-periphery organization of complex networks
- Parsimonious module inference in large networks
- Identification of core-periphery structure in networks
- Spectral statistics of Erdős-Rényi graphs I: Local semicircle law
- Model Selection for Degree-corrected Block Models
- A Fast Algorithm for the Discrete Core/Periphery Bipartitioning Problem
- Spectral properties of Google matrix of Wikipedia and other networks
Cited by in corpus (10)
- Detection of Core-Periphery Structure in Networks Using Spectral Methods and Geodesic Paths
- Disentangling bipartite and core-periphery structure in financial networks
- Super-resolution community detection for layer-aggregated multilayer networks
- Principal eigenvector localization and centrality in networks: revisited
- Double phase transition of the Ising model in core-periphery networks
- Optimal information diffusion in stochastic block models
- Heterogenous criticality in high frequency finance: a phase transition in flash crashes
- Centralities in complex networks
- Informative core identification in complex networks
- Spectral density of equitable core-periphery graphs