Inferences of modularity for graphs evolved by the clustering attachment model

DOI10.1007/978-3-031-88307-1_4MaRDI QIDQ6877721zbMATH OpenFDO

Authors Natalia M. Markovich, Maksim Ryzhov

Publication date 8 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-88307-1_4

zbMATH Keywords

clustering attachment modelmodularityrandom graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites work

• Extremes and related properties of random sequences and processes
• Inference for Clusters of Extreme Values
• Investigation of triangle counts in graphs evolving by clustering attachment
• Networks
• Random graphs and complex networks. Volume 1
• Random graphs.
• Statistics of Extremes
• Threshold selection for extremal index estimation

This page was built for publication: Inferences of modularity for graphs evolved by the clustering attachment model

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