Degree-based goodness-of-fit tests for heterogeneous random graph models: independent and exchangeable cases

DOI10.1111/SJOS.12410MaRDI QIDQ5108976zbMATH OpenOpenAlexWikidataFDO

Authors Sarah Ouadah, Stéphane Robin, Pierre Latouche

Publication date 7 May 2020

Published in Scandinavian Journal of Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1507.08140

zbMATH Keywords

graphonrandom graphsgoodness of fit\(W\)-graphtopology of a networkdegree variance

Mathematics Subject Classification ID

Applications of graph theory (05C90) Probabilistic graphical models (62H22) Applications of statistics to environmental and related topics (62P12) Applications of statistics to social sciences (62P25) Topological data analysis (62R40)

Abstract: The degrees are a classical and relevant way to study the topology of a network. They can be used to assess the goodness-of-fit for a given random graph model. In this paper we introduce goodness-of-fit tests for two classes of models. First, we consider the case of independent graph models such as the heterogeneous Erd"os-R'enyi model in which the edges have different connection probabilities. Second, we consider a generic model for exchangeable random graphs called the W-graph. The stochastic block model and the expected degree distribution model fall within this framework. We prove the asymptotic normality of the degree mean square under these independent and exchangeable models and derive formal tests. We study the power of the proposed tests and we prove the asymptotic normality under specific sparsity regimes. The tests are illustrated on real networks from social sciences and ecology, and their performances are assessed via a simulation study.

Recommendations

• Testing goodness of fit of random graph models
• Two-sample hypothesis testing for inhomogeneous random graphs
• Testing degree corrections in stochastic block models
• Exchangeable random networks
• The method of moments and degree distributions for network models

Cited in

(10)

• Adjusted chi-square test for degree-corrected block models
• A comparative power analysis of the maximum degree and size invariants for random graph inference
• Long-term stability of interacting Hawkes processes on random graphs
• Edgeworth expansions for network moments
• Testing goodness of fit of random graph models
• Asymptotics of score test in the generalized \(\beta\)-model for networks
• Tractably modelling dependence in networks beyond exchangeability
• Motif-based tests for bipartite networks
• Multivariate Hawkes processes on inhomogeneous random graphs
• Clique and cycle frequencies in a sparse random graph model with overlapping communities

This page was built for publication: Degree-based goodness-of-fit tests for heterogeneous random graph models: independent and exchangeable cases

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