3 papers
math.CO2025
New bounds on the modularity of
Katarzyna Rybarczyk, Małgorzata Sulkowska
Modularity is a parameter indicating the presence of community structure in the graph. Nowadays it lies at the core of widely used clustering algorithms. We study the modularity of…
math.CO2025
Normal approximation for number of edges in random intersection graphs
Katarzyna Rybarczyk, Grzegorz Serafin
The random intersection graph model is considered. Due to substantial edge dependencies, studying even fundamental statistics such as the subgraph count is sign…
math.CO2016
Poisson approximation of counts of subgraphs in random intersection graphs
Katarzyna Rybarczyk, Dudley Stark
Random intersection graphs are characterized by three parameters: , and , where is the number of vertices, is the number of objects, and is the probability th…