Affiliation:
1. Computer Science, Babes-Bolyai University of Cluj-Napoca, Cluj-Napoca, Romania
Abstract
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 node degree centrality as a form of importance metric. An analysis is done on both generated synthetic networks and real-world derived data on the topic of United States House and Senate committees, using a newly designed algorithm. The numerical results show that the combination of the critical node detection on hypergraphs with the weighted node degree centrality provides promising results and the topic is worth exploring further.
Funder
The Romanian National Authority for Scientific Research and Innovation, CNCS–UEFISCDI
Reference28 articles.
1. Scale-free networks in cell biology;Albert;Journal of Cell Science,2005
2. Managing network risk via critical node identification;Arulselvan,2007
3. Networks in ecology;Bascompte;Basic and Applied Ecology,2007
4. Identifying sets of key players in a social network;Borgatti;Computational & Mathematical Organization Theory,2006
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献