Skip to Main Content
By defining community recursive coefficient M, we propose a new efficient algorithm called filtration split algorithm for discovering community structure in complex networks. By optimizing the M of child-networks based on dynamic recursive principle, the local communities are discovered automatically. Theoretical analysis and experiment results show that the algorithm can filtrate more than one edge once and make the networks split in parallel. For a network with n vertices, m edges, and c communities, the computation complexity is less than O((c+1)m+(c+1)). For many real-world networks are sparse m~n and c+1 Ltn, our algorithm can run in essentially linear time O((c+1)n).
Date of Conference: 7-11 June 2008