Controlling a networked SIS model via a single input over undirected graphs

Dan Wang; Ji Liu; Philip E. Paré; Wei Chen; Li Qiu; Carolyn L. Beck; Tamer Basar

doi:10.1016/j.ifacol.2020.12.001

Controlling a networked SIS model via a single input over undirected graphs

Dan Wang^*
, Ji Liu
, Philip E. Paré
, Wei Chen
, Li Qiu^*
, Carolyn L. Beck
, Tamer Basar

^*Corresponding author for this work

Department of Electronic and Computer Engineering

Research output: Contribution to journal › Conference article published in journal › peer-review

7 Citations (Scopus)

Abstract

This paper formulates and studies the problem of controlling a networked SIS model using a single input in which the network structure is described by a connected undirected graph. A necessary and sufficient condition on the values of curing and infection rates for the healthy state to be exponentially stable is obtained via the analysis of signed Laplacians when the control input is the curing budget of a single agent. In the case when the healthy state is stabilizable, an explicit expression for the minimum curing budget is provided. The utility of the algorithm is demonstrated using a simulation over a network of cities in the northeastern United States.

Original language	English
Pages (from-to)	10981-10986
Number of pages	6
Journal	IFAC Proceedings Volumes (IFAC-PapersOnline)
Volume	53
Issue number	2
DOIs	https://doi.org/10.1016/j.ifacol.2020.12.001
Publication status	Published - 2020
Event	21st IFAC World Congress 2020 - Berlin, Germany Duration: 12 Jul 2020 → 17 Jul 2020

Bibliographical note

Publisher Copyright:
Copyright © 2020 The Authors. This is an open access article under the CC BY-NC-ND license

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 3 Good Health and Well-being

Access to Document

10.1016/j.ifacol.2020.12.001

Cite this

@article{ace5898cb7c34534bbd306b42eff7851,

title = "Controlling a networked SIS model via a single input over undirected graphs",

abstract = "This paper formulates and studies the problem of controlling a networked SIS model using a single input in which the network structure is described by a connected undirected graph. A necessary and sufficient condition on the values of curing and infection rates for the healthy state to be exponentially stable is obtained via the analysis of signed Laplacians when the control input is the curing budget of a single agent. In the case when the healthy state is stabilizable, an explicit expression for the minimum curing budget is provided. The utility of the algorithm is demonstrated using a simulation over a network of cities in the northeastern United States.",

author = "Dan Wang and Ji Liu and Par{\'e}, \{Philip E.\} and Wei Chen and Li Qiu and Beck, \{Carolyn L.\} and Tamer Basar",

note = "Publisher Copyright: Copyright {\textcopyright} 2020 The Authors. This is an open access article under the CC BY-NC-ND license; 21st IFAC World Congress 2020 ; Conference date: 12-07-2020 Through 17-07-2020",

year = "2020",

doi = "10.1016/j.ifacol.2020.12.001",

language = "English",

volume = "53",

pages = "10981--10986",

journal = "IFAC Proceedings Volumes (IFAC-PapersOnline)",

issn = "1474-6670",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Controlling a networked SIS model via a single input over undirected graphs

AU - Wang, Dan

AU - Liu, Ji

AU - Paré, Philip E.

AU - Chen, Wei

AU - Qiu, Li

AU - Beck, Carolyn L.

AU - Basar, Tamer

PY - 2020

Y1 - 2020

N2 - This paper formulates and studies the problem of controlling a networked SIS model using a single input in which the network structure is described by a connected undirected graph. A necessary and sufficient condition on the values of curing and infection rates for the healthy state to be exponentially stable is obtained via the analysis of signed Laplacians when the control input is the curing budget of a single agent. In the case when the healthy state is stabilizable, an explicit expression for the minimum curing budget is provided. The utility of the algorithm is demonstrated using a simulation over a network of cities in the northeastern United States.

AB - This paper formulates and studies the problem of controlling a networked SIS model using a single input in which the network structure is described by a connected undirected graph. A necessary and sufficient condition on the values of curing and infection rates for the healthy state to be exponentially stable is obtained via the analysis of signed Laplacians when the control input is the curing budget of a single agent. In the case when the healthy state is stabilizable, an explicit expression for the minimum curing budget is provided. The utility of the algorithm is demonstrated using a simulation over a network of cities in the northeastern United States.

UR - https://www.scopus.com/pages/publications/85105076780

U2 - 10.1016/j.ifacol.2020.12.001

DO - 10.1016/j.ifacol.2020.12.001

M3 - Conference article published in journal

AN - SCOPUS:85105076780

SN - 1474-6670

VL - 53

SP - 10981

EP - 10986

JO - IFAC Proceedings Volumes (IFAC-PapersOnline)

JF - IFAC Proceedings Volumes (IFAC-PapersOnline)

IS - 2

T2 - 21st IFAC World Congress 2020

Y2 - 12 July 2020 through 17 July 2020

ER -

Controlling a networked SIS model via a single input over undirected graphs

Abstract

Bibliographical note

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this