Random networks, graphical models and exchangeability

We study conditional independence relationships for random networks and their interplay with exchangeability. We show that, for finitely exchangeable network models, the empirical subgraph densities are maximum likelihood estimates of their theoretical counterparts. We then characterize all possible Markov structures for finitely exchangeable random graphs, thereby identifying a new class of Markov network models corresponding to bidirected Kneser graphs. In particular, we demonstrate that the fundamental property of dissociatedness corresponds to a Markov property for exchangeable networks described by bidirected line graphs. Finally we study those exchangeable models that are also summarized in the sense that the probability of a network depends only on the degree distribution, and we identify a class of models that is dual to the Markov graphs of Frank and Strauss. Particular emphasis is placed on studying consistency properties of network models under the process of forming subnetworks and we show that the only consistent systems of Markov properties correspond to the empty graph, the bidirected line graph of the complete graph and the complete graph.

[1]  Takis Konstantopoulos,et al.  On the extendibility of finitely exchangeable probability measures , 2015, Transactions of the American Mathematical Society.

[2]  Agata Fronczak,et al.  Exponential random graph models , 2012, Encyclopedia of Social Network Analysis and Mining. 2nd Ed..

[3]  Emily B. Fox,et al.  Sparse graphs using exchangeable random measures , 2014, Journal of the Royal Statistical Society. Series B, Statistical methodology.

[4]  W. Dempsey,et al.  A framework for statistical network modeling , 2015, 1509.08185.

[5]  Mark S Handcock,et al.  Local dependence in random graph models: characterization, properties and statistical inference , 2015, Journal of the American Statistical Association.

[6]  Daniel M. Roy,et al.  Bayesian Models of Graphs, Arrays and Other Exchangeable Random Structures , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Pavel N Krivitsky,et al.  On the Question of Effective Sample Size in Network Modeling: An Asymptotic Inquiry. , 2011, Statistical science : a review journal of the Institute of Mathematical Statistics.

[8]  A. Rinaldo,et al.  Statistical Models for Degree Distributions of Networks , 2014, 1411.3825.

[9]  Ove Frank,et al.  http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained , 2007 .

[10]  Jukka Corander,et al.  Stratified Graphical Models - Context-Specific Independence in Graphical Models , 2013, 1309.6415.

[11]  T. Yan,et al.  A central limit theorem in the β-model for undirected random graphs with a diverging number of vertices , 2012, 1202.3307.

[12]  A. Rinaldo,et al.  CONSISTENCY UNDER SAMPLING OF EXPONENTIAL RANDOM GRAPH MODELS. , 2011, Annals of statistics.

[13]  Kayvan Sadeghi.  Stable mixed graphs , 2011, 1110.4168.

[14]  A. Roverato,et al.  Log-mean linear models for binary data , 2011, 1109.6239.

[15]  Stephen E. Fienberg,et al.  Maximum lilkelihood estimation in the $\beta$-model , 2011, 1105.6145.

[16]  P. Diaconis,et al.  Estimating and understanding exponential random graph models , 2011, 1102.2650.

[17]  M. Schweinberger.  Instability, Sensitivity, and Degeneracy of Discrete Exponential Families , 2011, Journal of the American Statistical Association.

[18]  Allan Sly,et al.  Random graphs with a given degree sequence , 2010, 1005.1136.

[19]  Tom A. B. Snijders.  Conditional Marginalization for Exponential Random Graph Models , 2010 .

[20]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[21]  Stephen E. Fienberg.  Introduction to papers on the modeling and analysis of network data , 2010 .

[22]  Eric D. Kolaczyk,et al.  Statistical Analysis of Network Data: Methods and Models , 2009 .

[23]  Eric D. Kolaczyk,et al.  Statistical Analysis of Network Data , 2009 .

[24]  A. Rinaldo,et al.  On the geometry of discrete exponential families with application to exponential random graph models , 2008, 0901.0026.

[25]  Martina Morris,et al.  ergm: A Package to Fit, Simulate and Diagnose Exponential-Family Models for Networks. , 2008, Journal of statistical software.

[26]  D. Hunter,et al.  Goodness of Fit of Social Network Models , 2008 .

[27]  T. Richardson,et al.  Binary models for marginal independence , 2007, 0707.3794.

[28]  P. Diaconis,et al.  Graph limits and exchangeable random graphs , 2007, 0712.2749.

[29]  Radko Mesiar,et al.  Institute of Information Theory and Automation of the AS CR , 2008 .

[30]  S. Janson,et al.  Graph limits and exchangeable random graphs , 2007, 0712.2749.

[31]  V. Sós,et al.  Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.

[32]  S. Lauritzen.  Exchangeable Rasch Matrices∗ , 2007 .

[33]  G. Székely,et al.  Definetti’s Theorem for Abstract Finite Exchangeable Sequences , 2006 .

[34]  P. Pattison,et al.  New Specifications for Exponential Random Graph Models , 2006 .

[35]  László Lovász,et al.  Limits of dense graph sequences , 2004, J. Comb. Theory B.

[36]  O. Kallenberg.  Probabilistic Symmetries and Invariance Principles , 2005 .

[37]  P. Diaconis.  Finite forms of de Finetti's theorem on exchangeability , 1977, Synthese.

[38]  T. Richardson.  Markov Properties for Acyclic Directed Mixed Graphs , 2003 .

[39]  P. Spirtes,et al.  Ancestral graph Markov models , 2002 .

[40]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[41]  Michael I. Jordan.  Graphical Models , 2003 .

[42]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1997, Networks.

[43]  S. Wasserman,et al.  Logit models and logistic regressions for social networks: I. An introduction to Markov graphs andp , 1996 .

[44]  Craig Boutilier,et al.  Context-Specific Independence in Bayesian Networks , 1996, UAI.

[45]  G. Kauermann.  On a dualization of graphical Gaussian models , 1996 .

[46]  F. M. Atúš.  FINITE PARTIALLY EXCHANGEABLE ARRAYS , 1995 .

[47]  N. Wermuth,et al.  Linear Dependencies Represented by Chain Graphs , 1993 .

[48]  C. Geyer,et al.  Constrained Monte Carlo Maximum Likelihood for Dependent Data , 1992 .

[49]  O. Frank.  Statistical analysis of change in networks , 1991 .

[50]  D. J. Strauss,et al.  Pseudolikelihood Estimation for Social Networks , 1990 .

[51]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[52]  A. Baddeley,et al.  Nearest-Neighbour Markov Point Processes and Random Sets , 1989 .

[53]  S. Lauritzen.  Extremal Families and Systems of Sufficient Statistics , 1988 .

[54]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[55]  D. Aldous.  Exchangeability and related topics , 1985 .

[56]  École d'été de probabilités de Saint-Flour,et al.  École d'été de probabilités de Saint-Flour XIII - 1983 , 1985 .

[57]  B. Bollobás.  The evolution of random graphs , 1984 .

[58]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[59]  Kathryn B. Laskey,et al.  Stochastic blockmodels: First steps , 1983 .

[60]  D. Aldous.  Representations for partially exchangeable arrays of random variables , 1981 .

[61]  D. Freedman,et al.  On the statistics of vision: The Julesz conjecture☆ , 1981 .

[62]  P. Holland,et al.  An Exponential Family of Probability Distributions for Directed Graphs , 1981 .

[63]  D. Freedman,et al.  Finite Exchangeable Sequences , 1980 .

[64]  O. Barndorff-Nielsen.  Information and Exponential Families in Statistical Theory , 1980 .

[65]  G. Eagleson,et al.  Limit theorems for weakly exchangeable arrays , 1978, Mathematical Proceedings of the Cambridge Philosophical Society.

[66]  B. Silverman,et al.  Limit theorems for dissociated random variables , 1976, Advances in Applied Probability.

[67]  M. Bálek,et al.  Large Networks and Graph Limits , 2022 .