Graph limits and exchangeable random graphs

著者: Persi Diaconis, Svante Janson - arXiv 2007 被引用: 288

Abstract. 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 Lovász and many coauthors). Along the way, we translate the graph theory into more classical probability. 1.