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:
| Autores principales: | , |
|---|---|
| Formato: | article |
| Lenguaje: | EN FR IT |
| Publicado: |
Sapienza Università Editrice
2008
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/92ce215649104556bd37cfe550936bd4 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Sea el primero en dejar un comentario!