Looking for overlapping community detection algorithm with following properties:
- undirected unweighted graph
- potentially overlapping communities
- good scalability to 1M nodes
- good intuitive results on simple hand-crafted examples, with tens of nodes
- choosing the number of communities: 1) automatic; or 2) as input parameter
- (optional) suitable for multi-threaded execution
- (very optional) weighted edges
I have examined the BigClam, it looks good. BigClam multi-threaded implementation is C++ is part of SNAP package. I'd like to be sure that I don't miss better solutions.