27 citations · 73 across the 20 of their papers we have counts for
4 papers · 1 filter
Modularity and Graph Expansion
Baptiste Louf, Colin McDiarmid, Fiona Skerman
We relate two important notions in graph theory: expanders which are highly connected graphs, and modularity a parameter of a graph that is primarily used in community detection. M…
On graphs with modularity zero or near-zero
Colin McDiarmid, Fiona Skerman
It is known that complete graphs and complete multipartite graphs have modularity zero. We show that the least number of edges we may delete from the complete graph to obtain…
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…
Logical limit laws for Mallows random permutations
Tobias Muller, Fiona Skerman, Teun W. Verstraaten
A random permutation of follows the $\DeclareMathOperator{\Mallows}{Mallows}\Mallows(n,q)$ distribution with parameter if is pro…