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