License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.AofA.2018.31
URN: urn:nbn:de:0030-drops-89242
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8924/
McDiarmid, Colin ;
Skerman, Fiona
Modularity of Erdös-Rényi Random Graphs
Abstract
For a given graph G, modularity gives a score to each vertex partition, with higher values taken to indicate that the partition better captures community structure in G. The modularity q^*(G) (where 0 <= q^*(G)<= 1) of the graph G is defined to be the maximum over all vertex partitions of the modularity value. Given the prominence of modularity in community detection, it is an important graph parameter to understand mathematically.
For the Erdös-Rényi random graph G_{n,p} with n vertices and edge-probability p, the likely modularity has three distinct phases. For np <= 1+o(1) the modularity is 1+o(1) with high probability (whp), and for np --> infty the modularity is o(1) whp. Between these regions the modularity is non-trivial: for constants 1 < c_0 <= c_1 there exists delta>0 such that when c_0 <= np <= c_1 we have delta<q^*(G)<1-delta whp. For this critical region, we show that whp q^*(G_{n,p}) has order (np)^{-1/2}, in accord with a conjecture by Reichardt and Bornholdt in 2006 (and disproving another conjecture from the physics literature).
BibTeX - Entry
@InProceedings{mcdiarmid_et_al:LIPIcs:2018:8924,
author = {Colin McDiarmid and Fiona Skerman},
title = {{Modularity of Erd{\"o}s-R{\'e}nyi Random Graphs}},
booktitle = {29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)},
pages = {31:1--31:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-078-1},
ISSN = {1868-8969},
year = {2018},
volume = {110},
editor = {James Allen Fill and Mark Daniel Ward},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8924},
URN = {urn:nbn:de:0030-drops-89242},
doi = {10.4230/LIPIcs.AofA.2018.31},
annote = {Keywords: Community detection, Newman-Girvan Modularity, random graphs}
}
|
Keywords: |
|
Community detection, Newman-Girvan Modularity, random graphs |
|
Collection: |
|
29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
18.06.2018 |
