Universal lower bound for community structure of sparse graphs
When applying community detection in practice, one of the most commonly used methods is to try to find a partition that achieves a high modularity. Unfortunately, this is not a statistically justified method, and so it is in general unclear how to determine if the partition one finds is actually significant, or just the product of random noise.
Jul 14, 2023
