BERNOULLI GRAPH BOUNDS FOR GENERAL RANDOM GRAPHS

General random graphs (i.e., stochastic models/or networks incorporating heterogeneity and/or dependence among edges) are increasingly in wide use in the study of social and other networks, but Jew techniques other than simulation have been available for studying their behavior. On the other hand, random graphs with independent edges (i.e., the Bernoulli graphs) are well-studied, and a large literature exists regarding their properties. In this paper, we demonstrate a method for leveraging this knowledge by constructing families of Bernoulli graphs that bound the behavior of an arbitrary random graph in a well-defined sense. By studying the behavior of these Bernoulli graph bounds, we can thus constrain the properties of a given random graph. We illustrate the utility of this approach via application to several problems from the social network literature, including identifying degeneracy in Markov graph models, studying the potential impact of tie formation mechanisms on epidemic potential in sexual contact networks, and robustness testing of inhomogeneous Bernoulli models based on geographical covariates. Practical heuristics for assessing bound tightness and guidance for use in theoretical and methodological applications are also discussed.