A Simple Model for Complex Networks with Arbitrary Degree Distribution and Clustering

Abstract

This is a paper as part of the reviewed proceedings of the ICML 2006 Workshop on Statistical Network Analysis, entitled ‘Statistical Network Analysis: Models, Issues, and New Directions’ published in the Lecture Notes in Computer Science Series.

We present a stochastic model for networks with arbitrary degree distributions and average clustering coefficient. Many descriptions of networks are based solely on their computed degree distribution and clustering coefficient. We propose a statistical model based on these characterizations. This model generalizes models based solely on the degree distribution and is within the curved exponential family class. We present alternative parameterizations of the model. Each parameterization of the model is interpretable and tunable. We present a simple Markov Chain Monte Carlo (MCMC) algorithm to generate networks with the specified characteristics. We provide an algorithm based on MCMC to infer the network properties from network data and develop statistical inference for the model. The model is generalizable to include mixing based on attributes and other complex social structure. An application is made to modeling a protein to protein interaction network.

Publication
Lecture Notes in Computer Science, Statistical Network Analysis: Models, Issues, and New Directions