Testing goodness of fit of random graph models

DOI10.3390/A5040629MaRDI QIDQ1736535zbMATH OpenOpenAlexFDO

Authors Péter Hussami, János Komlós, Tamás F. Móri, Lídia Rejtő, Gábor Tusnády, Villő Csiszár

Publication date 26 March 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

maximum likelihoodrandom graphrank entropy

Mathematics Subject Classification ID

Hypothesis testing in multivariate analysis (62H15) Random graphs (graph-theoretic aspects) (05C80)

Abstract: Random graphs are matrices with independent 0, 1 elements with probabilities determined by a small number of parameters. One of the oldest model is the Rasch model where the odds are ratios of positive numbers scaling the rows and columns. Later Persi Diaconis with his coworkers rediscovered the model for symmetric matrices and called the model beta. Here we give goodnes-of-fit tests for the model and extend the model to a version of the block model introduced by Holland, Laskey, and Leinhard.

Recommendations

• Degree-based goodness-of-fit tests for heterogeneous random graph models: independent and exchangeable cases
• \(\beta\) models for random hypergraphs with a given degree sequence
• Stochastic Blockmodels for Directed Graphs
• Metric models for random graphs
• Exchangeable Rasch matrices

Cites work

• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• A nonparametric view of network models and Newman–Girvan and other modularities
• A sequential importance sampling algorithm for generating random graphs with prescribed degrees
• An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
• Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
• Complex graphs and networks
• Estimating and understanding exponential random graph models
• Graver basis for an undirected graph and its application to testing the beta model of random graphs
• Nonparametric goodness-of-fit tests for the Rasch model
• Random graphs with a given degree sequence
• Reconstruction and estimation in the planted partition model
• Sequential Monte Carlo Methods for Statistical Analysis of Tables
• Spectra and optimal partitions of weighted graphs
• Spectra of edge-independent random graphs
• Spectra of random graphs with given expected degrees
• Spectral clustering and the high-dimensional stochastic blockmodel
• Statistical inference on random structures
• Sufficient statistics and latent trait models
• The number of graphs and a random graph with a given degree sequence
• Very large graphs
• When the degree sequence is a sufficient statistic

Cited in

(5)

• Statistical modelling of network panel data: Goodness of fit
• Graver basis for an undirected graph and its application to testing the beta model of random graphs
• Subgraph network random effects error components models: specification and testing
• Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm
• Degree-based goodness-of-fit tests for heterogeneous random graph models: independent and exchangeable cases

This page was built for publication: Testing goodness of fit of random graph models

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