Approximating temporal modularity on graphs of small underlying treewidth
As with the other papers in my PhD, this one concerns the detection of community structure in graphs. The difference is that we notice something new about reality: Time exists. Things change over time - new connections are added to our graphs. How does this affect the problem of detecting the community structure in said graph?
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