Immunization for complex network based on the effective degree of vertex

Abstract

The basic idea of many effective immunization strategies is first to rank the importance of vertices according to the degrees of vertices and then remove the vertices from highest importance to lowest until the network becomes disconnected. Here we define the effective degrees of vertex, i.e., the number of its connections linking to un-immunized nodes in current network during the immunization procedure, to rank the importance of vertex, and modify these strategies by using the effective degrees of vertices. Simulations on both the scale-free network models with various degree correlations and two real networks have revealed that the immunization strategies based on the effective degrees are often more effective than those based on the degrees in the initial network.

16 pages, 5 figures

References in corpus (8)

• The structure and function of complex networks
• Finding and evaluating community structure in networks
• Efficient Immunization Strategies for Computer Networks and Populations
• Velocity and hierarchical spread of epidemic outbreaks in scale-free networks
• Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity
• Improving immunization strategies
• Efficient routing on scale-free networks based on local information
• Collective synchronization induced by epidemic dynamics on complex networks with communities