Sampling and Inference for Beta Neutral-to-the-Left Models of Sparse Networks

Abstract

Empirical evidence suggests that heavy-tailed degree distributions occurring in many real networks are well-approximated by power laws with exponents $\eta$ that may take values either less than and greater than two. Models based on various forms of exchangeability are able to capture power laws with $\eta <2$, and admit tractable inference algorithms; we draw on previous results to show that $\eta >2$ cannot be generated by the forms of exchangeability used in existing random graph models. Preferential attachment models generate power law exponents greater than two, but have been of limited use as statistical models due to the inherent difficulty of performing inference in non-exchangeable models. Motivated by this gap, we design and implement inference algorithms for a recently proposed class of models that generates $\eta$ of all possible values. We show that although they are not exchangeable, these models have probabilistic structure amenable to inference. Our methods make a large class of previously intractable models useful for statistical inference.

arXiv commentAccepted for publication in the proceedings of Conference on Uncertainty in Artificial Intelligence (UAI) 2018

References in corpus (8)

• Emergence of scaling in random networks
• Power laws, Pareto distributions and Zipf's law
• Sparse graphs using exchangeable random measures
• Are Gibbs-type priors the most natural generalization of the Dirichlet process?
• Sparse exchangeable graphs and their limits via graphon processes
• The Class of Random Graphs Arising from Exchangeable Random Measures
• Poisson calculus for spatial neutral to the right processes
• Preferential Attachment and Vertex Arrival Times