Centralities in complex networks
arXiv:2105.01931 · doi:10.1007/978-3-642-27737-5_765-1
Abstract
In network science complex systems are represented as a mathematical graphs consisting of a set of nodes representing the components and a set of edges representing their interactions. The framework of networks has led to significant advances in the understanding of the structure, formation and function of complex systems. Social and biological processes such as the dynamics of epidemics, the diffusion of information in social media, the interactions between species in ecosystems or the communication between neurons in our brains are all actively studied using dynamical models on complex networks. In all of these systems, the patterns of connections at the individual level play a fundamental role on the global dynamics and finding the most important nodes allows one to better understand and predict their behaviors. An important research effort in network science has therefore been dedicated to the development of methods allowing to find the most important nodes in networks. In this short entry, we describe network centrality measures based on the notions of network traversal they rely on. This entry aims at being an introduction to this extremely vast topic, with many contributions from several fields, and is by no means an exhaustive review of all the literature about network centralities.
arXiv comment10 pages, 3 figures. Entry for the volume "Statistical and Nonlinear Physics" of the Encyclopedia of Complexity and Systems Science, Chakraborty, Bulbul (Ed.), Springer, 2021 Updated version
References in corpus (32)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Community structure in social and biological networks
- Community detection in graphs
- Error and attack tolerance of complex networks
- Maps of random walks on complex networks reveal community structure
- Epidemic processes in complex networks
- Identification of influential spreaders in complex networks
- Breakdown of the Internet under intentional attack
- Subgraph Centrality in Complex Networks
- Influence maximization in complex networks through optimal percolation
- Influence of fake news in Twitter during the 2016 US presidential election
- Random walks and diffusion on networks
- Spectral redemption: clustering sparse networks
- Eigenvector centrality of nodes in multiplex networks
- Network dismantling
- Avoiding catastrophic failure in correlated networks of networks
- Graph Metrics for Temporal Networks
- Identifying optimal targets of network attack by belief propagation
- Spectral centrality measures in complex networks
- Fast and simple decycling and dismantling of networks
- The k-core as a predictor of structural collapse in mutualistic ecosystems
- Google matrix analysis of directed networks
- Clique Graphs and Overlapping Communities
- Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality
- Finding influential nodes for integration in brain networks using optimal percolation theory
- The Key Player Problem in Complex Oscillator Networks and Electric Power Grids: Resistance Centralities Identify Local Vulnerabilities
- Robustness of Synchrony in Complex Networks and Generalized Kirchhoff Indices
- Beyond the locally tree-like approximation for percolation on real networks
- The localization of non-backtracking centrality in networks and its physical consequences
- Centrality metrics and localization in core-periphery networks