Showing math.COShow all
3 papers · 1 filter
math.CO2025
Approximating temporal modularity on graphs of small underlying treewidth
Vilhelm Agdur, Jessica Enright, Laura Larios-Jones +3
Modularity is a very widely used measure of the level of clustering or community structure in networks. Here we consider a recent generalisation of the definition of modularity to…
math.CO2024
A classification of overlapping clustering schemes for hypergraphs
Vilhelm Agdur
Community detection in graphs is a problem that is likely to be relevant whenever network data appears, and consequently the problem has received much attention with many different…
math.CO2023
Universal lower bound for community structure of sparse graphs
Vilhelm Agdur, Nina Kamčev, Fiona Skerman
We prove new lower bounds on the modularity of graphs. Specifically, the modularity of a graph with average degree is , under some mild assumptions…