Sparse graphs using exchangeable random measures
Statistical network modelling has focused on representing the graph as a discrete structure, namely the adjacency matrix. When assuming exchangeability of this array—which can aid in modelling, computations and theoretical analysis—the Aldous–Hoover theorem informs us that the graph is necessarily e...
| Principais autores: | , |
|---|---|
| Formato: | Journal article |
| Publicado em: |
Wiley
2017
|