Fast Detection of Community Structures using Graph Traversal in Social Networks

Abstract

Finding community structures in social networks is considered to be a challenging task as many of the proposed algorithms are computationally expensive and does not scale well for large graphs. Most of the community detection algorithms proposed till date are unsuitable for applications that would require detection of communities in real-time, especially for massive networks. The Louvain method, which uses modularity maximization to detect clusters, is usually considered to be one of the fastest community detection algorithms even without any provable bound on its running time. We propose a novel graph traversal-based community detection framework, which not only runs faster than the Louvain method but also generates clusters of better quality for most of the benchmark datasets. We show that our algorithms run in O(|V | + |E|) time to create an initial cover before using modularity maximization to get the final cover. Keywords - community detection; Influenced Neighbor Score; brokers; community nodes; communities

29 pages, 9 tables, and 13 figures. Accepted in "Knowledge and Information Systems", 2018

References in corpus (9)

• Fast unfolding of communities in large networks
• Modularity and community structure in networks
• Cooperative Game Theory Approaches for Network Partitioning
• Maps of random walks on complex networks reveal community structure
• Near linear time algorithm to detect community structures in large-scale networks
• Benchmark graphs for testing community detection algorithms
• Community detection in networks: A user guide
• Extending the definition of modularity to directed graphs with overlapping communities
• Quantifying and identifying the overlapping community structure in networks