K-path centrality: a new centrality measure in social networks

  title={K-path centrality: a new centrality measure in social networks},
  author={Tharaka Alahakoon and Rahul Tripathi and Nicolas Kourtellis and Ramanuja Simha and Adriana Iamnitchi},
This paper proposes an alternative way to identify nodes with high betweenness centrality. It introduces a new metric, κ-path centrality, and a randomized algorithm for estimating it, and shows empirically that nodes with high κ-path centrality have high node betweenness centrality. Experimental evaluations on diverse real and synthetic social networks show improved accuracy in detecting high betweenness centrality nodes and significantly reduced execution time when compared to known randomized… CONTINUE READING
Highly Cited
This paper has 51 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 24 extracted citations

Privacy-Preserving Schemes for Ad Hoc Social Networks: A Survey

IEEE Communications Surveys & Tutorials • 2017
View 3 Excerpts
Highly Influenced

The gravity of an edge

Applied Network Science • 2018
View 2 Excerpts

Community-based link prediction

Multimedia Tools and Applications • 2016
View 1 Excerpt

52 Citations

Citations per Year
Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-7 of 7 references

Stanford large network dataset collection

J. Leskovec
http://snap.stanford.edu/data/ • 2009
View 6 Excerpts
Highly Influenced

Centrality Estimation in Large Networks

I. J. Bifurcation and Chaos • 2007
View 4 Excerpts
Highly Influenced

A set of measures of centrality based on betweenness

L. Freeman
Sociometry, 40(1):35–41 • 1977
View 9 Excerpts
Highly Influenced

The rush in a directed graph

J. Anthonisse
Technical Report BN9/71, Stichting Mathematisch Centrum, Amsterdam, Netherlands • 1971
View 9 Excerpts
Highly Influenced

Fast Approximation of Centrality

J. Graph Algorithms Appl. • 2001
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…