On Exchangeability in Network Models

DOI10.18409/JAS.V10I1.73zbMATH Open1418.60028arXiv1709.03885OpenAlexW2962786854MaRDI QIDQ5226941FDOQ5226941

Kayvan Sadeghi, Steffen Lauritzen, Alessandro Rinaldo

Publication date: 2 August 2019

Published in: Journal of Algebraic Statistics (Search for Journal in Brave)

Abstract: We derive representation theorems for exchangeable distributions on finite and infinite graphs using elementary arguments based on geometric and graph-theoretic concepts. Our results elucidate some of the key differences, and their implications, between statistical network models that are finitely exchangeable and models that define a consistent sequence of probability distributions on graphs of increasing size.

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

zbMATH Keywords

de Finetti's theoremfinite exchangeabilitygraphonsMöbius simplexpositive semidefinite functions

Mathematics Subject Classification ID

Multivariate analysis (62H99) Random graphs (graph-theoretic aspects) (05C80) Exchangeability for stochastic processes (60G09)

Cited In (9)

• Longitudinal network models and permutation‐uniform Markov chains
• Link investment substitutability: a factor influencing network formation
• Hierarchical models for independence structures of networks
• Hierarchical Network Models for Exchangeable Structured Interaction Processes
• Harmonic analysis of symmetric random graphs
• On finite exchangeability and conditional independence
• Exchangeable and sampling-consistent distributions on rooted binary trees
• House exchange and residential segregation in networks
• U-Statistics on bipartite exchangeable networks

This page was built for publication: On Exchangeability in Network Models

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