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
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
Originalsprog | Engelsk |
---|---|
Tidsskrift | Journal of Algebraic Statistics |
Vol/bind | 10 |
Udgave nummer | 1 |
Sider (fra-til) | 85-114 |
ISSN | 1309-3452 |
DOI | |
Status | Udgivet - 12 apr. 2019 |