Centrality Measures in Complex Networks: A Survey
arXiv:2011.07190
Abstract
In complex networks, each node has some unique characteristics that define the importance of the node based on the given application-specific context. These characteristics can be identified using various centrality metrics defined in the literature. Some of these centrality measures can be computed using local information of the node, such as degree centrality and semi-local centrality measure. Others use global information of the network like closeness centrality, betweenness centrality, eigenvector centrality, Katz centrality, PageRank, and so on. In this survey, we discuss these centrality measures and the state of the art literature that includes the extension of centrality measures to different types of networks, methods to update centrality values in dynamic networks, methods to identify top-k nodes, approximation algorithms, open research problems related to the domain, and so on. The paper is concluded with a discussion on application specific centrality measures that will help to choose a centrality measure based on the network type and application requirements.
References in corpus (30)
- An index to quantify an individual's scientific research output
- Efficient Behavior of Small-World Networks
- Assortative mixing in networks
- The structure of scientific collaboration networks
- The diameter of the world wide web
- Identification of influential spreaders in complex networks
- Who is the best connected scientist? A study of scientific coauthorship networks
- New Model of Internet Topology Using k-shell Decomposition
- MEDUSA - New Model of Internet Topology Using k-shell Decomposition
- Centrality Measures in Spatial Networks of Urban Streets
- Ranking spreaders by decomposing complex networks
- Betweenness centrality correlation in social networks
- Localization and centrality in networks
- Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity
- Ranking the spreading influence in complex networks
- Dynamics of networking agents competing for high centrality and low degree
- A Note on the PageRank of Undirected Graphs
- Identifying Geographic Clusters: A Network Analytic Approach
- Endorsement Deduction and Ranking in Social Networks
- Measuring centrality by a generalization of degree
- Random Spatial Network Models with Core-Periphery Structure
- Incremental Algorithms for Network Management and Analysis based on Closeness Centrality
- A Faster Method to Estimate Closeness Centrality Ranking
- Rank me thou shalln't Compare me
- Estimating the Degree Centrality Ranking of a Node
- A Survey on Studying the Social Networks of Students
- Degree Ranking Using Local Information
- Global Rank Estimation
- PageRank algorithm for Directed Hypergraph
- International Collaboration in Science: The Global Map and the Network