On Exchangeability in Network Models
Statistics Theory
2018-09-18 v2 Statistics Theory
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.
Cite
@article{arxiv.1709.03885,
title = {On Exchangeability in Network Models},
author = {Steffen L. Lauritzen and Alessandro Rinaldo and Kayvan Sadeghi},
journal= {arXiv preprint arXiv:1709.03885},
year = {2018}
}
Comments
Dedicated to the memory of Steve Fienberg