Cargando…
The critical node detection problem in hypergraphs using weighted node degree centrality
Network analysis is an indispensable part of today’s academic field. Among the different types of networks, the more complex hypergraphs can provide an excellent challenge and new angles for analysis. This study proposes a variant of the critical node detection problem for hypergraphs using weighted...
Autor principal: | Képes, Tamás-Zsolt |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
PeerJ Inc.
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10280579/ https://www.ncbi.nlm.nih.gov/pubmed/37346680 http://dx.doi.org/10.7717/peerj-cs.1351 |
Ejemplares similares
-
Hypergraphs with edge-dependent vertex weights: p-Laplacians and spectral clustering
por: Zhu, Yu, et al.
Publicado: (2023) -
Identifying Vital Nodes in Hypergraphs Based on Von Neumann Entropy
por: Hu, Feng, et al.
Publicado: (2023) -
Predicting Node Degree Centrality with the Node Prominence Profile
por: Yang, Yang, et al.
Publicado: (2014) -
Non-uniform Evolving Hypergraphs and Weighted Evolving Hypergraphs
por: Guo, Jin-Li, et al.
Publicado: (2016) -
Community detection in large hypergraphs
por: Ruggeri, Nicolò, et al.
Publicado: (2023)