scientific article; zbMATH DE number 7359763

DOI10.4230/LIPIcs.AofA.2018.31zbMath1482.05312MaRDI QIDQ4993553

Fiona Skerman, Colin J. H. McDiarmid

Publication date: 15 June 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

random graphscommunity detectionNewman-Girvan modularity

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (2)

Modularity of Erdős‐Rényi random graphs ⋮ The parameterised complexity of computing the maximum modularity of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• When are networks truly modular?
• Modularity in several random graph models
• A Random Graph Model for Power Law Graphs
• Asymptotic Modularity of Some Graph Classes
• On Finding Graph Clusterings with Maximum Modularity
• Communities in Networks
• The Spectra of Random Graphs with Given Expected Degrees
• Bisecting sparse random graphs
• On the Laplacian Eigenvalues of G_n,p
• Networks
• Maximum modular graphs

This page was built for publication: