Cargando…
Generative hypergraph models and spectral embedding
Many complex systems involve interactions between more than two agents. Hypergraphs capture these higher-order interactions through hyperedges that may link more than two nodes. We consider the problem of embedding a hypergraph into low-dimensional Euclidean space so that most interactions are short...
Autores principales: | Gong, Xue, Higham, Desmond J., Zygalakis, Konstantinos |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9834284/ https://www.ncbi.nlm.nih.gov/pubmed/36631576 http://dx.doi.org/10.1038/s41598-023-27565-9 |
Ejemplares similares
-
Epidemics on hypergraphs: spectral thresholds for extinction
por: Higham, Desmond J., et al.
Publicado: (2021) -
Directed network Laplacians and random graph models
por: Gong, Xue, et al.
Publicado: (2021) -
Connectivity of Random Geometric Hypergraphs
por: de Kergorlay, Henry-Louis, et al.
Publicado: (2023) -
Hypergraphs with edge-dependent vertex weights: p-Laplacians and spectral clustering
por: Zhu, Yu, et al.
Publicado: (2023) -
Non-uniform Evolving Hypergraphs and Weighted Evolving Hypergraphs
por: Guo, Jin-Li, et al.
Publicado: (2016)