Spectral Methods for Immunization of Large Networks

Individual Behavior Modeling and Transmission Control During Disease Spread: A Review

“…In Ref. [28], the authors gave an approximate proof. Let be the largest eigenvalue of the adjacency matrix after removing from the original point set.…”

“…Then in Ref. [28], the authors improved the Netshield algorithm and proposed the Netshield+ algorithm, which reduces the time complexity of the algorithm.…”

“…Considering that many control methods are available for removing nodes, and they deal with the same problems, in this paper, we compare the effects of different methods. These methods are: Netshield [27] , Netshield+ [28] , Acquaintance [23] , GreedyDrop [29] , HighDegree [22] , LowDegree [22] , SuperSpreader [24] , SVID [30] , ModCentrality [25] , and CommCentrality [26] . We conduct experiments on a scale-free network of 1000 nodes, and the average degree of the network is 6, each experiment is repeated 100 times and averaged, the result is shown in Fig.…”