On Exchangeability in Network Models

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

Steffen L. Lauritzen, Alessandro Rinaldo, Kayvan Sadeghi

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
OriginalsprogEngelsk
TidsskriftJournal of Algebraic Statistics
Sider (fra-til)85-114
ISSN1309-3452
DOI
StatusUdgivet - 12 apr. 2019

ID: 216382223