Modularity of Erdős-Rényi random graphs

DOI10.4230/LIPICS.AOFA.2018.31MaRDI QIDQ4993553zbMATH OpenFDO

Authors Fiona Skerman, Colin McDiarmid

Publication date 15 June 2021

Full work available at URL https://doi.org/10.4230/LIPICS.AOFA.2018.31

zbMATH Keywords

community detectionNewman-Girvan modularityrandom graphs

Mathematics Subject Classification ID

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

Recommendations

• Modularity of Erdős-Rényi random graphs
• Modularity of regular and treelike graphs
• On the modularity of 3‐regular random graphs and random graphs with given degree sequences
• When are networks truly modular?
• Modularity in several random graph models

Cites work

• A Random Graph Model for Power Law Graphs
• Asymptotic modularity of some graph classes
• Bisecting sparse random graphs
• Communities in Networks
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Maximum modular graphs
• Modularity in several random graph models
• Networks. An introduction.
• On Finding Graph Clusterings with Maximum Modularity
• On the Laplacian Eigenvalues of G_n,p
• The Spectra of Random Graphs with Given Expected Degrees
• When are networks truly modular?

Cited in

(7)

• Modularity in several random graph models
• New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)
• Ensemble nonequivalence in random graphs with modular structure
• scientific article; zbMATH DE number 1943957 (Why is no real title available?)
• Modularity of Erdős-Rényi random graphs
• On the modularity of 3‐regular random graphs and random graphs with given degree sequences
• The parameterised complexity of computing the maximum modularity of a graph

This page was built for publication: Modularity of Erdős-Rényi random graphs

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