Random networks, graphical models and exchangeability

DOI10.1111/RSSB.12266zbMATH Open1398.62218arXiv1701.08420OpenAlexW2585890768WikidataQ57393999 ScholiaQ57393999MaRDI QIDQ4962075FDOQ4962075

Authors: Alessandro Rinaldo, Kayvan Sadeghi, Steffen Lauritzen 

Publication date: 30 October 2018

Published in: Journal of the Royal Statistical Society Series B: Statistical Methodology (Search for Journal in Brave)

Abstract: 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 only depends onthe degree distribution, and identify a class of models that is dual to the Markov graphs of Frank and Strauss (1986). 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.

Full work available at URL: https://arxiv.org/abs/1701.08420

Recommendations

• On finite exchangeability and conditional independence
• Markov Graphs
• On exchangeability in network models
• Exchangeable random networks
• Network representation using graph root distributions

zbMATH Keywords

graphonKneser graphde Finetti's theoremPetersen graphgraph limitexchangeable arraysbidirected Markov propertyexponential random-graph modelmarginal beta modelMöbius parameterization

Mathematics Subject Classification ID

Markov processes: estimation; hidden Markov models (62M05) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15)

Cited In (27)

• Longitudinal network models and permutation‐uniform Markov chains
• Exchangeable Rasch matrices
• Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities
• Statistical evaluation of algebraic constraints for social networks
• Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
• On exchangeability in network models
• Exponential-family random graph models for multi-layer networks
• Hierarchical models for independence structures of networks
• Hierarchical Network Models for Exchangeable Structured Interaction Processes
• Concentration and consistency results for canonical and curved exponential-family models of random graphs
• Parties and networks: Stochastic models for relationship networks
• Consistent structure estimation of exponential-family random graph models with block structure
• Discussion to: ``Bayesian graphical models for modern biological applications by Y. Ni, V. Baladandayuthapani, M. Vannucci and F. C. Stingo
• Quantifying Statistical Interdependence by Message Passing on Graphs—Part II: Multidimensional Point Processes
• Link Prediction for Egocentrically Sampled Networks
• Algebraic statistics for a directed random graph model with reciprocation
• Network representation using graph root distributions
• New exploratory tools for extremal dependence: \(\chi \) networks and annual extremal networks
• How social networks influence human behavior: an integrated latent space approach for differential social influence
• Tractably modelling dependence in networks beyond exchangeability
• Graphical models for complex networks: an application to Italian museums
• On the number of non-zero elements of joint degree vectors
• Community detection with dependent connectivity
• Harmonic analysis of symmetric random graphs.
• Exchangeable random networks
• On finite exchangeability and conditional independence
• U-Statistics on bipartite exchangeable networks

This page was built for publication: Random networks, graphical models and exchangeability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4962075)