On Exchangeability in Network Models
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.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon submission, authors agree with the following Article Submission Agreement. Once the papers are published, authors are required to use the DOI link provided on all websites and arXiv postings of their paper.
As this is an open access journal, all articles have a creative commons license.