Testing goodness of fit of random graph models

DOI10.3390/a5040629zbMath1461.05183arXiv1211.2442OpenAlexW2106926856MaRDI QIDQ1736535

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

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

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)

Related Items

Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
• Spectra of edge-independent random graphs
• Reconstruction and estimation in the planted partition model
• Random graphs with a given degree sequence
• Spectral clustering and the high-dimensional stochastic blockmodel
• When the degree sequence is a sufficient statistic
• Sufficient statistics and latent trait models
• Spectra and optimal partitions of weighted graphs
• Graver basis for an undirected graph and its application to testing the beta model of random graphs
• Estimating and understanding exponential random graph models
• Nonparametric goodness-of-fit tests for the Rasch model
• An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
• A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
• A nonparametric view of network models and Newman–Girvan and other modularities
• Very large graphs
• The number of graphs and a random graph with a given degree sequence
• Spectra of random graphs with given expected degrees
• Sequential Monte Carlo Methods for Statistical Analysis of Tables