Ranking the spreading influence of nodes in complex networks based on mixing degree centrality and local structure
arXiv:2003.03583
Abstract
The safety and robustness of the network have attracted the attention of people from all walks of life, and the damage of several key nodes will lead to extremely serious consequences. In this paper, we proposed the clustering H-index mixing (CHM) centrality based on the H- index of the node itself and the relative distance of its neighbors. Starting from the node itself and combining with the topology around the node, the importance of the node and its spreading capability were determined. In order to evaluate the performance of the proposed method, we use Susceptible-Infected-Recovered (SIR) model, monotonicity and resolution as the evaluation standard of experiment. Experimental results in artificial networks and real-world networks show that CHM centrality has excellent performance in identifying node importance and its spreading capability.
References in corpus (12)
- The structure and function of complex networks
- Community structure in social and biological networks
- Epidemic spreading in scale-free networks
- Lethality and centrality in protein networks
- Cooperative Game Theory Approaches for Network Partitioning
- The spread of epidemic disease on networks
- Identification of influential spreaders in complex networks
- Self-similar community structure in organisations
- Identifying influential spreaders in complex networks based on gravity formula
- Disease spreading in populations of moving agents
- Accurate ranking of influential spreaders in networks based on dynamically asymmetric link-impact
- Epidemic spreading induced by diversity of agents' mobility