Issue No. 08 - Aug. (2013 vol. 24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.229
Simone Mainardi , University of Pisa and Italian National Research Council, Pisa
Enrico Gregori , Italian National Research Council, Pisa
Luciano Lenzini , University of Pisa, Pisa
The analysis of real-world complex networks has been the focus of recent research. Detecting communities helps in uncovering their structural and functional organization. Valuable insight can be obtained by analyzing the dense, overlapping, and highly interwoven $(k)$-clique communities. However, their detection is challenging due to extensive memory requirements and execution time. In this paper, we present a novel, parallel $(k)$-clique community detection method, based on an innovative technique which enables connected components of a network to be obtained from those of its subnetworks. The novel method has an unbounded, user-configurable, and input-independent maximum degree of parallelism, and hence is able to make full use of computational resources. Theoretical tight upper bounds on its worst case time and space complexities are given as well. Experiments on real-world networks such as the Internet and the World Wide Web confirmed the almost optimal use of parallelism (i.e., a linear speedup). Comparisons with other state-of-the-art $(k)$-clique community detection methods show dramatic reductions in execution time and memory footprint. An open-source implementation of the method is also made publicly available.
Communities, Internet, Complexity theory, Program processors, Parallel processing, Sparse matrices, Optimization, k-clique communities, Communities, Internet, Complexity theory, Program processors, Parallel processing, Sparse matrices, Optimization, parallel community detection method
Simone Mainardi, Enrico Gregori, Luciano Lenzini, "Parallel $(k)$-Clique Community Detection on Large-Scale Networks", IEEE Transactions on Parallel & Distributed Systems, vol. 24, no. , pp. 1651-1660, Aug. 2013, doi:10.1109/TPDS.2012.229