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

Authors:
Tharaka Alahakoon;Rahul Tripathi;Nicolas Kourtellis;Ramanuja Simha;Adriana Iamnitchi
Affiliations:
University of South Florida, Tampa, FL;University of South Florida, Tampa, FL;University of South Florida, Tampa, FL;University of South Florida, Tampa, FL;University of South Florida, Tampa, FL
Venue:
Proceedings of the 4th Workshop on Social Network Systems
Year:
2011

Citing 5
Cited 6

Estimating the size of generalized transitive closures

VLDB '89 Proceedings of the 15th international conference on Very large data bases
RETRACTED: Social networks of author--coauthor relationships

Computational Statistics & Data Analysis
Measurement-calibrated graph models for social network experiments

Proceedings of the 19th international conference on World wide web
Approximating betweenness centrality

WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
The Small World of File Sharing

IEEE Transactions on Parallel and Distributed Systems

Social network analysis of web links to eliminate false positives in collaborative anti-spam systems

Journal of Network and Computer Applications
A novel measure of edge centrality in social networks

Knowledge-Based Systems
Branded with a scarlet "C": cheaters in a gaming social network

Proceedings of the 21st international conference on World Wide Web
Enhancing community detection using a network weighting strategy

Information Sciences: an International Journal
DACCER: Distributed Assessment of the Closeness CEntrality Ranking in complex networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Mixing local and global information for community detection in large networks

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 algorithms.