Evaluating Local Community Methods in Networks

Abstract

We present a new benchmarking procedure that is unambiguous and specific to local community-finding methods, allowing one to compare the accuracy of various methods. We apply this to new and existing algorithms. A simple class of synthetic benchmark networks is also developed, capable of testing properties specific to these local methods.

8 pages, 9 figures, code included with source

References in corpus (4)

• Uncovering the overlapping community structure of complex networks in nature and society
• Comparing community structure identification
• Clique percolation in random networks
• Identifying "communities" within energy landscapes