Graph limits and exchangeable random graphs

We develop a clear connection between de Finetti’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.

Guardado en:

Detalles Bibliográficos
Autores principales:	Persi Diaconis, Svante Janson
Formato:	article
Lenguaje:	EN FR IT
Publicado:	Sapienza Università Editrice 2008
Materias:	graph limit exchangeable array de finetti’s theorem Mathematics QA1-939
Acceso en línea:	https://doaj.org/article/92ce215649104556bd37cfe550936bd4
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:92ce215649104556bd37cfe550936bd4
record_format	dspace
spelling	oai:doaj.org-article:92ce215649104556bd37cfe550936bd42021-11-29T14:19:32ZGraph limits and exchangeable random graphs1120-71832532-3350https://doaj.org/article/92ce215649104556bd37cfe550936bd42008-01-01T00:00:00Zhttps://www1.mat.uniroma1.it/ricerca/rendiconti/ARCHIVIO/2008(1)/33-61.pdfhttps://doaj.org/toc/1120-7183https://doaj.org/toc/2532-3350We develop a clear connection between de Finetti’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.Persi DiaconisSvante JansonSapienza Università Editricearticlegraph limitexchangeable arrayde finetti’s theoremMathematicsQA1-939ENFRITRendiconti di Matematica e delle Sue Applicazioni, Vol 28, Iss 1, Pp 33-61 (2008)
institution	DOAJ
collection	DOAJ
language	EN FR IT
topic	graph limit exchangeable array de finetti’s theorem Mathematics QA1-939
spellingShingle	graph limit exchangeable array de finetti’s theorem Mathematics QA1-939 Persi Diaconis Svante Janson Graph limits and exchangeable random graphs
description	We develop a clear connection between de Finetti’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.
format	article
author	Persi Diaconis Svante Janson
author_facet	Persi Diaconis Svante Janson
author_sort	Persi Diaconis
title	Graph limits and exchangeable random graphs
title_short	Graph limits and exchangeable random graphs
title_full	Graph limits and exchangeable random graphs
title_fullStr	Graph limits and exchangeable random graphs
title_full_unstemmed	Graph limits and exchangeable random graphs
title_sort	graph limits and exchangeable random graphs
publisher	Sapienza Università Editrice
publishDate	2008
url	https://doaj.org/article/92ce215649104556bd37cfe550936bd4
work_keys_str_mv	AT persidiaconis graphlimitsandexchangeablerandomgraphs AT svantejanson graphlimitsandexchangeablerandomgraphs
_version_	1718407237661097984

Graph limits and exchangeable random graphs

Ejemplares similares