Graph limits and exchangeable random graphs

Simple item page
dc.creatorDiaconis, Persi
dc.creatorJanson, Svante
dc.date2007-12-17
dc.date.accessioned2026-07-07T08:49:42Z
dc.date.available2026-07-07T08:49:42Z
dc.descriptionWe 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.
dc.description26 pages
dc.identifierhttps://arxiv.org/abs/0712.2749
dc.identifierhttp://arxiv.org/abs/0712.2749
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144394
dc.subjectProbability
dc.subjectCombinatorics
dc.titleGraph limits and exchangeable random graphs
dc.typetext

Files

Collections

arXiv