Modularity of Erdos-Rényi random graphs
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 modularit...
| Auteurs principaux: | , |
|---|---|
| Format: | Conference item |
| Publié: |
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
2018
|