arXiv · 1709.03885
On Exchangeability in Network Models
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.
Explore related subjects
Keep this discovery
Steffen L. Lauritzen, Alessandro Rinaldo, Kayvan Sadeghi. 2017-09-12. On Exchangeability in Network Models. https://arxiv.org/abs/1709.03885
Cite the original work for its findings. Save a collection to share your selection of sources.