Modularity in several random graph models

Liudmila Ostroumova Prokhorenkova, Pawel Pralat, Andrei M. Raigorodskii

Abstract: Modularity is a graph characteristic which measures the strength of division of a network into clusters (or communities). Networks with high modularity usually have distinguishable clusters with dense connections between the vertices within clusters and sparse connections between vertices of different clusters. In this paper, we investigate the value of modularity in several well-known random graph models.