Modularity in several random graph models

DOI10.1016/j.endm.2017.07.058zbMath1378.05187OpenAlexW2743743529MaRDI QIDQ1690041

Paweł Prałat, Liudmila Ostroumova Prokhorenkova, Andrei M. Raigorodskii

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.07.058

zbMATH Keywords

modularitypreferential attachmentrandom \(d\)-regular graphsspatial preferential attachment

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)

Related Items (15)

A Statistical Performance Analysis of Graph Clustering Algorithms ⋮ On the modularity of 3‐regular random graphs and random graphs with given degree sequences ⋮ Unnamed Item ⋮ Modularity in planted partition model ⋮ Graph clustering with Boltzmann machines ⋮ On the independence number and the chromatic number of generalized preferential attachment models ⋮ Unnamed Item ⋮ Modularity of Erdős‐Rényi random graphs ⋮ Graph Clustering Via Intra-Cluster Density Maximization ⋮ Exact modularity of line graphs of complete graphs ⋮ New lower bound on the modularity of Johnson graphs ⋮ Modularity of some distance graphs ⋮ New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\) ⋮ The parameterised complexity of computing the maximum modularity of a graph ⋮ Spectrum of Johnson graphs

Cites Work

• The diameter of a scale-free random graph
• Modularity of complex networks models
• A Spatial Web Graph Model with Local Influence Regions
• Emergence of Scaling in Random Networks
• Asymptotic Modularity of Some Graph Classes
• Preferential Placement for Community Structure Formation

This page was built for publication: Modularity in several random graph models