Cargando…
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...
Autores principales: | Caron, François, Fox, Emily B. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
John Wiley and Sons Inc.
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5699441/ https://www.ncbi.nlm.nih.gov/pubmed/29200934 http://dx.doi.org/10.1111/rssb.12233 |
Ejemplares similares
-
Fast Generation of Sparse Random Kernel Graphs
por: Hagberg, Aric, et al.
Publicado: (2015) -
On Edge Exchangeable Random Graphs
por: Janson, Svante
Publicado: (2017) -
Faster algorithms for counting subgraphs in sparse graphs
por: Bressan, Marco
Publicado: (2021) -
Graph theory and sparse matrix computation
por: George, Alan, et al.
Publicado: (1993) -
Fluctuations of extreme eigenvalues of sparse Erdős–Rényi graphs
por: He, Yukun, et al.
Publicado: (2021)