Showing math.COShow all
2 papers · 1 filter
math.CO2025
Modularity of random intersection graphs
Katarzyna Rybarczyk
Modularity was introduced by Newman and Girvan in 2004 and is used as a measure of community structure of networks represented by graphs. In our work we study modularity of the ran…
math.CO2019
The cover time of a sparse random intersection graph
Mindaugas Bloznelis, Jerzy Jaworski, Katarzyna Rybarczyk
Many known networks have structure of affiliation networks, where each of network's nodes (actors) selects an attribute set from a given collection of attributes and two no…