Graph limits and exchangeable random graphs
classification
🧮 math.PR
math.CO
keywords
graphexchangeablelimitsworkaldous--hoover--kallenbergalongareaarrays
read the original 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 Lovasz and many coauthors). Along the way, we translate the graph theory into more classical probability.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.