Modularity of the ABCD Random Graph Model with Community Structure

DOI10.1093/COMNET/CNAC050MaRDI QIDQ6392658arXivFDO

Authors Bogumił Kamiński, Paweł Prałat, François Théberge

Publication date 2 March 2022

Published in arXiv

Full work available at URL https://doi.org/10.1093/COMNET/CNAC050

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Mathematical sociology (including anthropology) (91D99)

arXiv classification

cs.LGcs.SImath.CO

Abstract: The Artificial Benchmark for Community Detection (ABCD) graph is a random graph model with community structure and power-law distribution for both degrees and community sizes. The model generates graphs with similar properties as the well-known LFR one, and its main parameter $xi$ can be tuned to mimic its counterpart in the LFR model, the mixing parameter $mu$. In this paper, we investigate various theoretical asymptotic properties of the ABCD model. In particular, we analyze the modularity function, arguably, the most important graph property of networks in the context of community detection. Indeed, the modularity function is often used to measure the presence of community structure in networks. It is also used as a quality function in many community detection algorithms, including the widely used Louvain algorithm.

This page was built for publication: Modularity of the ABCD Random Graph Model with Community Structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6392658)