On graphs with modularity zero or near-zero

DOI10.37236/12644MaRDI QIDQ7349263zbMATH OpenFDO

Authors Colin McDiarmid, Fiona Skerman

Publication date 16 September 2026

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/12644

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A nonparametric view of network models and Newman–Girvan and other modularities
• A note on graphs whose largest eigenvalues of the modularity matrix equals zero
• Asymptotic modularity of some graph classes
• Component behavior near the critical point of the random graph process
• Consistency of community detection in networks under degree-corrected stochastic block models
• Correction to the proof of consistency of community detection
• Fast unfolding of communities in large networks
• scientific article; zbMATH DE number 17680 (Why is no real title available?)
• Maximum modular graphs
• Modularity and graph expansion
• Modularity based community detection in hypergraphs
• Modularity of Erdős-Rényi random graphs
• Modularity of minor‐free graphs
• Modularity of regular and treelike graphs
• Modularity of the ABCD random graph model with community structure
• Networks. An introduction.
• On the modularity of 3‐regular random graphs and random graphs with given degree sequences
• Random graphs.
• Spectral properties of modularity matrices
• The modularity of random graphs on the hyperbolic plane

This page was built for publication: On graphs with modularity zero or near-zero

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