• Corpus ID: 226964904

Centrality Measures in Complex Networks: A Survey

@article{Saxena2020CentralityMI,
  title={Centrality Measures in Complex Networks: A Survey},
  author={Akrati Saxena and Sudarshan Iyengar},
  journal={ArXiv},
  year={2020},
  volume={abs/2011.07190}
}
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… 

Figures from this paper

Temporal Walk Centrality: Ranking Nodes in Evolving Networks
TLDR
It is shown that temporal walk centrality can identify nodes playing central roles in dissemination processes that might not be detected by related betweenness concepts and other common static and temporal centrality measures.
Organizational Closeness Centralities of Workflow-Supported Performer-to-Activity Affiliation Networks
TLDR
A series of formal approaches for building organizational closeness centrality measurement techniques on the specific type of affiliation networks and the ultimate implications of these analysis techniques as the performer-to-activity affiliation networking knowledge in workflow-supported organizations are discussed.
A Survey of Evolving Models for Weighted Complex Networks based on their Dynamics and Evolution
TLDR
This chapter discusses the evolution of weighted networks and evolving models to generate different types of synthetic weighted networks, including undirected, directed, signed, multilayered, community, and core-periphery structured weighted networks.
Evolving Models for Dynamic Weighted Complex Networks
  • A. Saxena
  • Computer Science
    Principles of Social Networking
  • 2021
TLDR
This chapter will cover the evolution of weighted complex networks and evolving models to generate different types of synthetic weighted networks, including undirected, directed, signed, multilayered, community, and core–periphery structured weighted networks.
Opportunities and challenges in partitioning the graph measure space of real-world networks
TLDR
The approach managed to identify well distinguishable groups of network domains and confer their relevant features, which turn out to be CND specific and not unique even at the level of individual CNDs.
The banking transactions dataset and its comparative analysis with scale-free networks
TLDR
This work constructs a network of 1.6 million nodes from banking transactions of users of Rabobank, the first publicly shared dataset of intra-bank transactions, and highlights the unique characteristics of banking transaction networks with other scale-free networks.
Task-based Evaluation of 3D Radial Layouts for Centrality Visualization
  • Computer Science
  • 2021
TLDR
Improvements to the 3D radial layouts that make it possible to visualize centrality measures of nodes in a graph and a human-centered evaluation are proposed in order to compare the efficiency score, the time to complete tasks and the number of clicks.
Identifying Ransomware Actors in the Bitcoin Network
TLDR
It is shown that very local subgraphs of the known such actors are sufficient to differentiate between ransomware, random and gambling actors with 85%prediction accuracy on the test data set.
Fake News Propagation and Mitigation Techniques: A Survey
...
1
2
...

References

SHOWING 1-10 OF 283 REFERENCES
Global Rank Estimation
TLDR
This work proposes fast and efficient methods to estimate the global centrality rank of a node without computing the centrality value of all nodes and discusses how to apply these methods for degree and closeness centralityRank estimation.
Decentralized algorithms for evaluating centrality in complex networks
TLDR
A general framework for decentral algorithms that calculate centrality indices is proposed and variants of the general algorithm to calculate four different centralities are described, with emphasis on the algorithm of the betweenness centrality.
Hybrid Centrality Measures for Binary and Weighted Networks
TLDR
New hybrid centrality measures (i.e., Degree-Degree, Degree-Closeness and Degree-Betweenness) are proposed by combining existing measures with a proposition to better understand the importance of actors in a given network to show prominence of the actor in a network.
Generalized walks-based centrality measures for complex biological networks.
Predicting Node Degree Centrality with the Node Prominence Profile
TLDR
It is shown that the proposed node prominence profile method is an effective predictor of degree centrality, and reveals that individuals in the early stage of evolution display a distinctive and robust signature indegree centrality trend, adequately predicted by their prominence profile.
Clustering Networks’ Heterogeneous Data in Defining a Comprehensive Closeness Centrality Index
TLDR
A new, efficient spectral approach for detecting the communities in multilayer networks using the concept of hybrid clustering, which integrates multiple data sources, particularly the structure of relations and individual characteristics of nodes in a network, to improve the comprehension of the network and the clustering accuracy.
Measuring centrality by a generalization of degree
  • L. Csató
  • Computer Science
    Central Eur. J. Oper. Res.
  • 2017
TLDR
A new parametric family of centrality measures called generalized degree is proposed, based on the idea that a relationship to a more interconnected node contributes to centrality in a greater extent than a connection to a less central one.
Localization and centrality in networks
TLDR
An alternative centrality measure based on the nonbacktracking matrix is proposed, which gives results closely similar to the standard eigenvector centrality in dense networks where the latter is well behaved but avoids localization and gives useful results in regimes where the standard centrality fails.
A heuristic approach to estimate nodes’ closeness rank using the properties of real world networks
TLDR
This work provides linear time heuristic algorithms which run in O(m), versus the classical algorithm which runs in time $$O(m \cdot n)$$O( m·n), where m is the number of edges and n is theNumber of nodes in the network.
...
1
2
3
4
5
...