Inferences for random graphs evolved by clustering attachment

DOI10.1016/J.JSPI.2025.106332MaRDI QIDQ6930813zbMATH OpenFDO

Authors Natalia M. Markovich, Maksim Ryzhov, Marijus Vaičiulis

Publication date 12 September 2025

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JSPI.2025.106332

zbMATH Keywords

attachment probabilityclustering attachmentclustering coefficientevolutionextreme value indexrandom graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Statistics of extreme values; tail inference (62G32) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites work

• A moment estimator for the index of an extreme-value distribution
• A simple general approach to inference about the tail of a distribution
• Are extreme value estimation methods useful for network data?
• Clustering in a hyperbolic model of complex networks
• Geometric inhomogeneous random graphs
• scientific article; zbMATH DE number 3954145 (Why is no real title available?)
• Investigation of triangle counts in graphs evolving by clustering attachment
• Mixed moment estimator and location invariant alternatives
• Nonparametric Analysis of Univariate Heavy‐Tailed Data
• On a conditionally Poissonian graph process
• Statistical mechanics of complex networks
• Statistics of Extremes
• Subgraphs in preferential attachment models

This page was built for publication: Inferences for random graphs evolved by clustering attachment

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