On Exchangeability in Network Models

  • Steffen Lauritzen University of Copenhagen
  • Alessandro Rinaldo Carnegie Mellon University
  • Kayvan Sadeghi University of Cambridge


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. 

Special Volume in honor of memory of S.E.Fienberg