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.
19 September 2018 in IEEE Transactions on Cybernetics
Leader-follower controllability on signed multiagent networks is investigated in this paper. Specifically, we consider a dynamic signed multiagent network, where the agents interact via neighbor-based Laplacian feedback and the network allows positive and negative edges to capture cooperative and competitive interactions among agents. The agents are classified as either leaders or followers, thus forming a leader-follower signed network. To enable full control of the leader-follower signed network, controllability ensured leader group selection approaches are investigated in this paper, that is, identifying a small subset of nodes in the signed network, such that the selected nodes are able to drive the network to a desired behavior, even in the presence of antagonistic interactions. In particular, graphical characterizations of the controllability of signed networks are first developed based on the investigation of the interaction between network topology and agent dynamics. Since signed path and cycle graphs are basic building blocks for a variety of networks, the developed topological characterizations are then exploited to develop leader selection methods for signed path and cycle graphs to ensure leader-follower controllability. Along with illustrative examples, heuristic algorithms are also developed showing how leader selection methods developed for path and cycle graphs can be potentially extended to more general signed networks. In contrast to existing results that mainly focus on unsigned networks, this paper characterizes controllability and develops leader selection methods for signed networks. In addition, the developed results are generic, in the sense that they are not only applicable to signed networks but also to unsigned networks, since unsigned networks are a particular case of signed networks that only contain positive edges.
19 August 2020 in IEEE Transactions on Automatic Control
This paper investigates energy-related controllability of complex networks. Specifically, our objective is to establish controllability characteristics on signed complex networks, where the network units interact via neighbor-based Laplacian feedback and the network admits positive and negative edges to capture cooperative and competitive interactions among these units. The network units can be classified into leaders and followers. This work focuses on characterizing the energy-related controllability in signed networks (i.e., the energy incurred by the leaders in the control of a network). To this end, controllability Gramian based measures are exploited to quantify the difficulty of the control problem on signed networks in terms of the required control energy. Fundamental relationships between these measures and network topology are developed via graph Laplacian to characterize energy-related controllability. It is revealed that, for structurally unbalanced signed graphs, the energy-related controllability is closely related to the diagonal entries of the inverse of the graph Laplacian.
5 October 2020 in IEEE Transactions on Automatic Control
This article characterizes the energy-related controllability of composite complex networks. We consider a class of composite networks constructed from simple factor networks via Cartesian product. The considered factor networks are leader-follower signed networks with neighbor-based Laplacian dynamics, adopting positive and negative edges to capture cooperative and competitive interactions among network units. Different from most existing works focusing on classical controllability, this article investigates the controllability of composite networks from energy-related perspectives. Specifically, controllability Gramian-based metrics, including average controllability and volumetric control energy, are characterized based on the Cartesian graph product, which reveals how the energy-related controllability of a composite network can be inferred from the spectral properties of the local factor systems. These results are then extended to layered control networks, a special, yet widely used, network structure in many man-made systems. Since structural balance is a key topological property of signed networks, a necessary and sufficient condition to verify the structural balance of composite signed networks is developed, which is applicable to generalized graph product.
During pandemics, countries, regions, and communities develop various epidemic models to evaluate spread and guide mitigation policies. However, model uncertainties caused by complex transmission behaviors, contact-tracing networks, time-varying parameters, human factors, and limited data present significant challenges to model-based approaches. To address these issues, we propose a novel framework that centers around reproduction number estimates to perform counterfactual analysis, strategy evaluation, and feedback control of epidemics. The framework 1) introduces a mechanism to quantify the impact of the testing-for-isolation intervention strategy on the basic reproduction number. Building on this mechanism, the framework 2) proposes a method to reverse engineer the effective reproduction number under different strengths of the intervention strategy. In addition, based on the method that quantifies the impact of the testing-for-isolation strategy on the basic reproduction number, the framework 3) proposes a closed-loop control algorithm that uses the effective reproduction number both as feedback to indicate the severity of the spread and as the control goal to guide adjustments in the intensity of the intervention. We illustrate the framework, along with its three core methods, by addressing three key questions and validating its effectiveness using data collected during the COVID-19 pandemic at the University of Illinois Urbana-Champaign (UIUC) and Purdue University: 1) How severe would an outbreak have been without the implemented intervention strategies? 2) What impact would varying the intervention strength have had on an outbreak? 3) How can we adjust the intervention intensity based on the current state of an outbreak?