REVIEW 4 cited by
Centrality Measures in Complex Networks: A Survey
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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.
Forward citations
Cited by 4 Pith papers
-
A Centrality Measure Using Magnitude Homology
A new family of graph centrality measures based on the change in (Eulerian) magnitude homology after deleting a vertex, with a proven locality property.
-
Node Importance Estimation Leveraging LLMs for Semantic Augmentation in Knowledge Graphs
LENIE generates LLM-augmented node descriptions, sampled via clustering-based triplet selection, and uses them as embeddings to improve node importance estimation in knowledge graphs.
-
System-Wide Termination in Distributed Betweenness Centrality Computation
A gossip-based global termination detector lets nodes in a distributed betweenness centrality computation stop only after all nodes have converged, avoiding premature-stop errors.
-
Dynamics of temporal influence in polarised networks
Temporal degree centrality and a modified temporal independent cascade model best recover ground-truth influence bands in polarized temporal networks, while eigenvector and closeness centralities perform poorly.
Discussion (0). Continue with ORCID to comment.