Yingbo Wu

The Rationality of Four Metrics of Network Robustness: A Viewpoint of Robust Growth of Generalized Meshes

There are quite a number of different metrics of network robustness. This paper addresses the rationality of four metrics of network robustness (the algebraic connectivity, the effective resistance, the average edge betweenness, and the efficiency) by investigating the robust growth of generalized meshes (GMs). First, a heuristic growth algorithm (the Proximity-Growth algorithm) is proposed. The resulting proximity-optimal GMs are intuitively robust and hence are adopted as the benchmark. Then, a generalized mesh (GM) is grown up by stepwise optimizing a given measure of network robustness. The following findings are presented: (1) The algebraic connectivity-optimal GMs deviate quickly from the proximity-optimal GMs, yielding a number of less robust GMs. This hints that the rationality of the algebraic connectivity as a measure of network robustness is still in doubt. (2) The effective resistace-optimal GMs and the average edge betweenness-optimal GMs are in line with the proximity-optimal GMs. This partly justifies the two quantities as metrics of network robustness. (3) The efficiency-optimal GMs deviate gradually from the proximity-optimal GMs, yielding some less robust GMs. This suggests the limited utility of the efficiency as a measure of network robustness.

On the Optimal Dynamic Control Strategy of Disruptive Computer Virus

Disruptive computer viruses have inflicted huge economic losses. This paper addresses the development of a cost-effective dynamic control strategy of disruptive viruses. First, the development problem is modeled as an optimal control problem. Second, a criterion for the existence of an optimal control is given. Third, the optimality system is derived. Next, some examples of the optimal dynamic control strategy are presented. Finally, the performance of actual dynamic control strategies is evaluated.

Reducing the Spectral Radius of a Torus Network by Link Removal

The optimal link removal (OLR) problem aims at removing a given number of links of a network so that the spectral radius of the residue network obtained by removing the links from the network attains the minimum. Torus networks are a class of regular networks that have witnessed widespread applications. This paper addresses three subproblems of the OLR problem for torus networks, where two or three or four edges are removed. For either of the three subproblems, a link-removing scheme is described. Exhaustive searches show that, for small-sized tori, each of the proposed schemes produces an optimal solution to the corresponding subproblem. Monte-Carlo simulations demonstrate that, for medium-sized tori, each of the three schemes produces a solution to the corresponding subproblem, which is optimal when compared to a large set of randomly produced link-removing schemes. Consequently, it is speculated that each of the three schemes produces an optimal solution to the corresponding subproblem for all torus networks. The set of links produced by each of our schemes is evenly distributed over a network, which may be a common feature of an optimal solution to the OLR problem for regular networks.

An effective rumor-containing strategy

Abstract False rumors can lead to huge economic losses or/and social instability. Hence, mitigating the impact of bogus rumors is of primary importance. This paper focuses on the problem of how to suppress a false rumor by use of the truth. Based on a set of rational hypotheses and a novel rumor-truth mixed spreading model, the effectiveness and cost of a rumor-containing strategy are quantified, respectively. On this basis, the original problem is modeled as a constrained optimization problem (the RC model), in which the independent variable and the objective function represent a rumor-containing strategy and the effectiveness of a rumor-containing strategy, respectively. The goal of the optimization problem is to find the most effective rumor-containing strategy subject to a limited rumor-containing budget. Some optimal rumor-containing strategies are given by solving their respective RC models. The influence of different factors on the highest cost effectiveness of a RC model is illuminated through computer experiments. The results obtained are instructive to develop effective rumor-containing strategies.

A tradeoff between the losses caused by computer viruses and the risk of the manpower shortage

This article addresses the tradeoff between the losses caused by a new virus and the size of the team for developing an antivirus against the virus. First, an individual-level virus spreading model is proposed to capture the spreading process of the virus before the appearance of its natural enemy. On this basis, the tradeoff problem is modeled as a discrete optimization problem. Next, the influences of different factors, including the infection force, the infection function, the available manpower, the alarm threshold, the antivirus development effort and the network topology, on the optimal team size are examined through computer simulations. This work takes the first step toward the tradeoff problem, and the findings are instructive to the decision makers of network security companies.

Effectiveness analysis of a mixed rumor-quelling strategy

Abstract Circulating the truth and quarantining a subset of rumor spreaders are two major rumor-quelling strategies. In practice, a mixture of the two strategies may be more effective than any one of the two strategies. This paper focuses on effectiveness analysis of the mixed strategy. For this purpose, we are going to establish a rumor-truth competing model on two-layer network. First, we introduce a Markov model characterizing the stochastic dynamics of the rumor-truth competing process, and write the corresponding Kolmogorov model capturing the expected dynamics of the rumor-truth competing process. Second, we give a bilinear model as the first approximation to the Kolmogorov model, and suggest a generic model as a more accurate approximation to the Kolmogorov model. The two models are the focus of concern in this work. For ease in treatment, we describe a limit system of the generic model. By studying the limit model, we present a criterion for the rumor to subside, a criterion for the rumor not necessarily to subside, and a criterion for the rumor to persist, respectively. These findings are instructive to the quelling of false rumors. Finally, through computer experiments we find that when a rumor subsides, the bilinear model is a good approximation to the Kolmogorov model.