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
Fixed-parameter tractability of the mixed-sign k-part minimum edge cut problem on sparse graphs
When applying community detection methods such as modularity, one encounters an optimization problem of the general form “I have a collection of objects that I need to divide into bags, and for each pair there is a cost or benefit associated to putting them in the same bag”. In general, this problem is very hard to solve, but for some particular instances, it is known to be easy when dividing into two bags.
May 1, 2025