Modularity of Erdős‐Rényi random graphs
Random Structures & Algorithms · 2020-08 · 57 (1) · 211-243
DOI: 10.1002/rsa.20910 ↗Kurz gefasst
Fachartikel in der Zeitschrift Random Structures & Algorithms, online erschienen am 20.03.2020. Verfasst von Colin McDiarmid und 1 weiteren Autor:innen. Die Arbeit wurde bisher 25-mal zitiert (Crossref) und nennt 47 Literaturangaben.
Abstract (Originalsprache)
For a given graph G , each partition of the vertices has a modularity score, with higher values indicating that the partition better captures community structure in G . The modularity q ∗ ( G ) of the graph G is defined to be the maximum over all vertex partitions of the modularity score, and satisfies 0 ≤ q ∗ ( G )
Zitieren
APA
McDiarmid, C., & Skerman, F. (2020). Modularity of Erdős‐Rényi random graphs. Random Structures & Algorithms, 57(1), 211-243. https://doi.org/10.1002/rsa.20910
Vancouver
McDiarmid C, Skerman F. Modularity of Erdős‐Rényi random graphs. Random Structures & Algorithms. 2020;57(1):211-243. doi:10.1002/rsa.20910
BibTeX
@article{McDiarmid2020,
author = {McDiarmid, Colin and Skerman, Fiona},
title = {Modularity of Erdős‐Rényi random graphs},
journal = {Random Structures & Algorithms},
year = {2020},
volume = {57},
number = {1},
pages = {211--243},
doi = {10.1002/rsa.20910}
}
EUVIMED