Degree-based network models

Abstract

We derive the sampling properties of random networks based on weights whose pairwise products parameterize independent Bernoulli trials. This enables an understanding of many degree-based network models, in which the structure of realized networks is governed by properties of their degree sequences. We provide exact results and large-sample approximations for power-law networks and other more general forms. This enables us to quantify sampling variability both within and across network populations, and to characterize the limiting extremes of variation achievable through such models. Our results highlight that variation explained through expected degree structure need not be attributed to more complicated generative mechanisms.

31 pages, 3 figures, submitted for publication

References in corpus (3)

• Generating simple random graphs with prescribed degree distribution
• Graph limits and exchangeable random graphs
• Universally Consistent Latent Position Estimation and Vertex Classification for Random Dot Product Graphs

Cited by in corpus (9)

• Sparse graphs using exchangeable random measures
• Nonparametric graphon estimation
• Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
• Null Models and Community Detection in Multi-Layer Networks
• Topology reveals universal features for network comparison
• Network modularity in the presence of covariates
• Properties of Latent Variable Network Models
• On decomposable random graphs
• Tractably Modelling Dependence in Networks Beyond Exchangeability