Parallel clustering with CFinder

Abstract

The amount of available data about complex systems is increasing every year, measurements of larger and larger systems are collected and recorded. A natural representation of such data is given by networks, whose size is following the size of the original system. The current trend of multiple cores in computing infrastructures call for a parallel reimplementation of earlier methods. Here we present the grid version of CFinder, which can locate overlapping communities in directed, weighted or undirected networks based on the clique percolation method (CPM). We show that the computation of the communities can be distributed among several CPU-s or computers. Although switching to the parallel version not necessarily leads to gain in computing time, it definitely makes the community structure of extremely large networks accessible.

arXiv commentElectronic version of an article published as http://www.worldscinet.com/ppl/22/2201/S0129626412400014.html copyright World Scientific Publishing Company

References in corpus (7)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Community detection in graphs
• Uncovering the overlapping community structure of complex networks in nature and society
• Hierarchical organization of modularity in metabolic networks
• Clique percolation in random networks
• Spectral and network methods in the analysis of correlation matrices of stock returns