Ranking of Closeness Centrality for Large-Scale Social Networks

DOI10.1007/978-3-540-69311-6_21zbMath1143.91362OpenAlexW1536060130MaRDI QIDQ3507332

Kazuya Okamoto, Wei Chen, Xiang-Yang Li

Publication date: 19 June 2008

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69311-6_21

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Related Items (8)

Properties of vector embeddings in social networks ⋮ Graph-based point drift: graph centrality on the registration of point-sets ⋮ Heuristical top-\(k\): fast estimation of centralities in complex networks ⋮ Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis ⋮ I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs ⋮ Optimal Controlled Nodes Selection for Fast Consensus ⋮ CoVerD: community-based vertex defense against crawling adversaries ⋮ Relating centralities in graphs and the principal eigenvector of its distance matrix

This page was built for publication: Ranking of Closeness Centrality for Large-Scale Social Networks