Modularity of tree-like and random regular graphs

Colin McDiarmid, Fiona Skerman

Research output: Working paperWorking paper and Preprints

71 Downloads (Pure)

Abstract

Clustering algorithms for large networks typically use the modularity score to compare which partitions better represent modular structure in the data. Given a network, the modularity of a partition of the vertex set is a number in [0, 1) which measures the extent to which edge density is higher within parts than between parts; and the modularity of the network is the maximum modularity of any partition. We show that random cubic graphs usually have modularity in the interval (0.666, 0.804); and random r-regular graphs for large r usually have modularity Θ(1/√r). Our results can give thresholds for the statistical significance of clustering found in large regular networks.

The modularity of cycles and low degree trees is known to be asymptotically 1. We extend these results to all graphs whose product of treewidth and maximum degree is much less than the number of edges. This shows for example that random planar graphs typically have modularity close to 1.
Original languageEnglish
PublisherarXiv.org
Number of pages6
Publication statusSubmitted - 2017

Fingerprint Dive into the research topics of 'Modularity of tree-like and random regular graphs'. Together they form a unique fingerprint.

Cite this