Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Locating influential nodes in hypergraphs via fuzzy collective influence (2404.01046v1)

Published 1 Apr 2024 in physics.soc-ph

Abstract: Complex contagion phenomena, such as the spread of information or contagious diseases, often occur among the population due to higher-order interactions between individuals. Individuals who can be represented by nodes in a network may play different roles in the spreading process, and thus finding the most influential nodes in a network has become a crucial topic in network science for applications such as viral marketing, rumor suppression, and disease control. To solve the problem of identifying nodes that have high influence in a complex system, we propose a higher-order distance-based fuzzy centrality methods (HDF and EHDF) that are customized for a hypergraph which can characterize higher-order interactions between nodes via hyperedges. The methods we proposed assume that the influence of a node is reliant on the neighboring nodes with a certain higher-order distance. We compare the proposed methods with the baseline centrality methods to verify their effectiveness. Experimental results on six empirical hypergraphs show that the proposed methods could better identify influential nodes, especially showing plausible performance in finding the top influential nodes. Our proposed theoretical framework for identifying influential nodes could provide insights into how higher-order topological structure can be used for tasks such as vital node identification, influence maximization, and network dismantling.

Summary

We haven't generated a summary for this paper yet.