×

On exchangeability in network models. (English) Zbl 1418.60028

Summary: 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.

MSC:

60G09 Exchangeability for stochastic processes
05C80 Random graphs (graph-theoretic aspects)
62H99 Multivariate analysis
PDFBibTeX XMLCite
Full Text: DOI arXiv