research
∙
07/14/2023
Universal lower bound for community structure of sparse graphs
We prove new lower bounds on the modularity of graphs. Specifically, the...
share
research
∙
12/21/2022
Is it easier to count communities than find them?
Random graph models with community structure have been studied extensive...
research
∙
12/25/2021
Modularity and edge sampling
Suppose that there is an unknown underlying graph G on a large vertex se...
research
∙
12/09/2019
No additional tournaments are quasirandom-forcing
A tournament H is quasirandom-forcing if the following holds for every s...
research
∙
07/18/2018
