This paper studies a distributed continuous-time bi-virus model in which two competing viruses spread over a network consisting of multiple groups of individuals. Limiting behaviors of the network are characterized by analyzing the equilibria of the system and their stability. Specifically, when the two viruses spread over possibly different directed infection graphs, the system may have (1) a unique equilibrium, the healthy state, which is globally stable, implying that both viruses will eventually be eradicated, (2) two equilibria including the healthy state and a dominant virus state, which is almost globally stable, implying that one virus will pervade the entire network causing a single-virus epidemic while the other virus will be eradicated, or (3) at least three equilibria including the healthy state and two dominant virus states, depending on certain conditions on the healing and infection rates. When the two viruses spread over the same directed infection graph, the system may have zero or infinitely many coexisting epidemic equilibria, which represents the pervasion of the two viruses. Sensitivity properties of some nontrivial equilibria are investigated in the context of a decentralized control technique, and an impossibility result is given for a certain type of distributed feedback controller.
10 October 2018 in IEEE Transactions on Control Systems Technology
Models of spreading processes over nontrivial networks are commonly motivated by modeling and analysis of biological networks, computer networks, and human contact networks. However, learning the spread parameters of such models has not yet been explored in detail, and the models have not been validated by real data. In this paper, we present several different spread models from the literature and explore their relationships to each other; for one of these processes, we present a sufficient condition for asymptotic stability of the healthy equilibrium, show that the condition is necessary and sufficient for uniqueness of the healthy equilibrium, and present necessary and sufficient conditions for estimating the spread parameters. Finally, we employ two real data sets, one from John Snow’s seminal work on cholera epidemics in London in the 1850s and the other one from the United States Department of Agriculture, to validate an approximation of a well-studied network-dependent susceptible-infected-susceptible model.
25 January 2022 in IEEE Transactions on Control of Network Systems
We propose a mathematical model to study coupled epidemic and opinion dynamics in a network of communities. Our model captures SIS epidemic dynamics, whose evolution is dependent on the opinions of the communities toward the epidemic, and vice versa. In particular, we allow both cooperative and antagonistic interactions, representing similar and opposing perspectives on the severity of the epidemic, respectively. We propose an opinion-dependent reproduction number to characterize the mutual influence between epidemic spreading and opinion dissemination over the networks. Through stability analysis of the equilibria, we explore the impact of opinions on both epidemic outbreak and eradication, characterized by bounds on the opinion-dependent reproduction number. We also show how to eradicate epidemics by reshaping the opinions, offering researchers an approach for designing control strategies to reach target audiences to ensure effective epidemic suppression.
12 February 2018 in IEEE Transactions on Automatic Control
The recently proposed DeGroot-Friedkin model describes the dynamical evolution of individual social power in a social network that holds opinion discussions on a sequence of different issues. This paper revisits that model, and uses nonlinear contraction analysis, among other tools, to establish several novel results. First, we show that for a social network with constant topology, each individual's social power converges to its equilibrium value exponentially fast, whereas previous results only concluded asymptotic convergence. Second, when the network topology is dynamic (i.e., the relative interaction matrix may change between any two successive issues), we show that the initial (perceived) social power of each individual is exponentially forgotten. Specifically, individual social power is dependent only on the dynamic network topology, and initial social power is forgotten as a result of sequential opinion discussion. Finally, we provide an explicit upper bound on an individual's social power as the number of issues discussed tends to infinity; this bound depends only on the network topology. Simulations are provided to illustrate our results.
12 June 2017 in IEEE Transactions on Automatic Control
Two asynchronous distributed algorithms are presented for solving a linear equation of the form Ax=b with at least one solution. The equation is simultaneously and asynchronously solved by m agents assuming that each agent knows only a subset of the rows of the partitioned matrix [A\ \ b], the estimates of the equation's solution generated by its neighbors, and nothing more. Neighbor relationships are characterized by a time-dependent directed graph whose vertices correspond to agents and whose arcs depict neighbor relationships. Each agent recursively updates its estimate of a solution at its own event times by utilizing estimates generated by its neighbors which are transmitted with delays. The event time sequences of different agents are not assumed to be synchronized. It is shown that for any matrix-vector pair (A, b) for which the equation has a solution and any repeatedly jointly strongly connected sequence of neighbor graphs defined on the merged sequence of all agents' event times, the algorithms cause all agents' estimates to converge exponentially fast to the same solution to Ax=b. The first algorithm requires a specific initialization step at each agent, and the second algorithm works for arbitrary initializations. Explicit expressions for convergence rates are provided, and a relation between local initializations and limiting consensus solutions is established, which is used to solve the least 2-norm solution.
28 February 2020 in IEEE Transactions on Computational Social Systems
To model the cross couplings of multiple topics, we develop a set of rules for opinion updates of a group of agents. The rules are used to design or assign values to the elements of weighting matrices. The cooperative and anticooperative couplings are modeled in both the inverse-proportional and proportional structures. The behaviors of opinion dynamics are analyzed using a nullspace property of the state-dependent matrix-weighted Laplacian matrices and a Lyapunov candidate. Various consensus properties of the state-dependent matrix-weighted Laplacian matrices are predicted according to the interagent network topology and interdependent topical coupling topologies.