Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.36799

On a Class of Decentralized Feedback Controllers for the Networked Bivirus SIS Model

Sebin Gracy·Mengbin Ye·Brian D. O. Anderson
View original source ↗Read source document ↗Export metadata ↓

Abstract

Recent work has established many properties of systems modeling the spread of two competing viruses in a population, and for networks with multiple connected populations with different spreading properties (e.g. men and women). This work considers the introduction of a class of nonlinear decentralized feedback controls aimed at reducing the fractions of populations infected at an endemic equilibrium. One surprising conclusion is that in some circumstances, new types of equilibria can arise. They can be viewed as an outcome of a transcritical bifurcation which is never observed for uncontrolled systems. In addition, we show that the controlled system is strongly monotone, and an unstable boundary equilibrium of the uncontrolled system cannot be stabilized using the class of decentralized state feedback controllers considered in this paper.

Explore related subjects

eess.SYcs.SY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sebin Gracy, Mengbin Ye, Brian D. O. Anderson. 2026-09-29. On a Class of Decentralized Feedback Controllers for the Networked Bivirus SIS Model. https://arxiv.org/abs/2609.36799

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Control Data Scheduling over Shared Communication Channels: A Sparse and Collision-Free Mechanism

In systems where controllers operate remotely and communicate with actuators over shared communication channels, it is crucial to efficiently schedule the control data transmission to reduce bandwidth usage and actuator effort. In this article, we investigate a novel scheduling mechanism that jointly coordinates control actions across different controllers and different time steps. We propose an algorithm based on the alternating direction method of multipliers (ADMM) to solve the resulting optimization problem. While ADMM is often treated as a black-box solver, the proposed algorithm offers a clear physical interpretation, ensures convergence to a stationary point, and is computationally efficient. Simulation results validate our theoretical results and demonstrate the effectiveness of our proposed algorithm.

eess.SY↗
arXiv2026

Discrete-time polynomial systems with inputs and outputs: structure, reachability, observability, and minimal realizations

We study the realization problem for discrete-time input/output polynomial systems. These are formalized using tools from commutative algebra and algebraic geometry as systems whose state spaces are algebraic varieties, or more abstractly the set of k-points of an affine k-scheme, where k is an arbitrary infinite field. The input/output behaviors of such systems are described by "polynomial response maps" in which outputs are polynomial functions of past inputs. The main results show that every polynomial response map admits a canonical (quasi-reachable and algebraically observable) realization, which is unique up to isomorphism. The key to the approach is to linearize dynamics by considering a "dual" system in which states are functions defined on states. Finite dimensionality of the canonical realization, and its polynomiality, are characterized in terms of the space, algebra, and field of observables of the map, as well as in terms of algebraic input/output difference equations, and by a Jacobian rank criterion. A particular subclass consists of the maps that we call "bounded," defined by the property that their degree in the past inputs is uniformly bounded. Bounded maps are shown to be finitely realizable if and only if they are realizable by finite-dimensional state-affine systems, whose theory in turn reduces to that of rational formal power series. We also study the lattice of quasi-reachable realizations of a given map, including normal realizations. This work is an update of the PhD thesis written by the author in 1976; connections to recent work are briefly discussed in the last section.

eess.SY↗
arXiv2026

Massachusetts' 2026 Clean Peak Standard Recalibration: Adaptation and Storage Tradeoffs

Massachusetts recalibrated its Clean Peak Standard (CPS) in 2026 by lowering the minimum standards and expanding the Near-Term Resource Multiplier for qualifying storage. This paper evaluates the change using a three-zone, hourly capacity expansion model for 2026--2030. Both scenarios achieve full CPS compliance, but the post-May scenario reduces new battery additions by 53.1% and modeled system cost by 3.7%. CPS-eligible discharge declines by 30.4%, while Clean Peak Energy Certificate production declines by only 9.5%. Fossil generation during CPS hours increases by 11.7%, whereas modeled emissions remain nearly unchanged because the Regional Greenhouse Gas Initiative cap binds. The recalibration therefore lowers the modeled storage capacity requirement while weakening physical clean-peak performance.

eess.SY↗