Temporal Modularity
This project is still ongoing, but should result in a paper within a month or two. We investigate community detection in temporal graphs, that is, graphs which evolve over time, and study the computational complexity of this problem.
Jun 1, 2025
A classification of overlapping clustering schemes for hypergraphs
In reality, friend groups often overlap, and some publications do belong both to biology and chemistry. Yet the most commonly used and studied community detection methods assume that all communities are distinct, with binary assignments to communities.
May 15, 2025
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