Null models for network data

Abstract

The analysis of datasets taking the form of simple, undirected graphs continues to gain in importance across a variety of disciplines. Two choices of null model, the logistic-linear model and the implicit log-linear model, have come into common use for analyzing such network data, in part because each accounts for the heterogeneity of network node degrees typically observed in practice. Here we show how these both may be viewed as instances of a broader class of null models, with the property that all members of this class give rise to essentially the same likelihood-based estimates of link probabilities in sparse graph regimes. This facilitates likelihood-based computation and inference, and enables practitioners to choose the most appropriate null model from this family based on application context. Comparative model fits for a variety of network datasets demonstrate the practical implications of our results.

12 pages, 2 figures; submitted for publication

References in corpus (3)

• Finding community structure in networks using the eigenvectors of matrices
• Stochastic blockmodels and community structure in networks
• Maximum lilkelihood estimation in the $\beta$-model

Cited by in corpus (17)

• Fast community detection by SCORE
• On community structure in complex networks: challenges and opportunities
• Model Selection for Degree-corrected Block Models
• Maximum lilkelihood estimation in the $\beta$-model
• A Spectral Framework for Anomalous Subgraph Detection
• Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
• Degree-based network models
• Null Models and Community Detection in Multi-Layer Networks
• POISED: Spotting Twitter Spam Off the Beaten Paths
• How Many Communities Are There?
• Causal Inference Under Network Interference: A Framework for Experiments on Social Networks
• Network modularity in the presence of covariates
• A Unified Framework for Inference in Network Models with Degree Heterogeneity and Homophily
• Network inference and community detection, based on covariance matrices, correlations and test statistics from arbitrary distributions
• A Random Dot Product Model for Weighted Networks
• Wilks' theorems in some exponential random graph models
• A network Poisson model for weighted directed networks with covariates