An extremely fast algorithm for identifying high closeness centrality vertices in large-scale networks

Vladimir Ufimtsev, Sanjukta Bhowmick

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

The significance of an entity in a network is generally given by the centrality value of its vertex. For most analysis purposes, only the high ranked vertices are required. However, most algorithms calculate the centrality values of all the vertices. We present an extremely fast and scalable algorithm for identifying the high closeness centrality vertices, using group testing. We show that our approach is significantly faster (bestcase over 50 times, worst-case over 7 times) than the currently used methods. We can also use group testing to identify networks that are sensitive to edge perturbation.

Original languageEnglish (US)
Title of host publicationProceedings of IA3 2014 - 4th Workshop on Irregular Applications
Subtitle of host publicationArchitectures and Algorithms, Held in conjunction with SC 2014: The International Conference for High Performance Computing, Networking, Storage and Analysis
PublisherAssociation for Computing Machinery, Inc
Pages53-56
Number of pages4
ISBN (Electronic)9781479970568
DOIs
Publication statusPublished - Nov 16 2014
Event4th Workshop on Irregular Applications: Architectures and Algorithms, IA3 2014 - New Orleans, United States
Duration: Nov 16 2014Nov 21 2014

Publication series

NameProceedings of IA3 2014 - 4th Workshop on Irregular Applications: Architectures and Algorithms, Held in conjunction with SC 2014: The International Conference for High Performance Computing, Networking, Storage and Analysis

Other

Other4th Workshop on Irregular Applications: Architectures and Algorithms, IA3 2014
CountryUnited States
CityNew Orleans
Period11/16/1411/21/14

    Fingerprint

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Modeling and Simulation

Cite this

Ufimtsev, V., & Bhowmick, S. (2014). An extremely fast algorithm for identifying high closeness centrality vertices in large-scale networks. In Proceedings of IA3 2014 - 4th Workshop on Irregular Applications: Architectures and Algorithms, Held in conjunction with SC 2014: The International Conference for High Performance Computing, Networking, Storage and Analysis (pp. 53-56). (Proceedings of IA3 2014 - 4th Workshop on Irregular Applications: Architectures and Algorithms, Held in conjunction with SC 2014: The International Conference for High Performance Computing, Networking, Storage and Analysis). Association for Computing Machinery, Inc. https://doi.org/10.1109/IA3.2014.12