We develop a clear connection between deFinetti's theorem for exchangeable arrays (work of Aldous--Hoover--Kallenberg) and the emerging area of graph limits (work of Lovasz and many coauthors). Along the way, we translate the graph theory into more classical probability.
No takes yet. Share an insight, caveat, or question.
Diaconis et al. (2007) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: