A distributed algorithm for virus spread minimization

This paper proposes a discrete-time distributed algorithm based on a local replicator dynamics that allows a group of nodes to achieve virus mitigation over a connected graph when subject to limited resources. The algorithm is distributed in the sense that it can be implemented by the network nodes via local and anonymous interactions. By employing a discrete-time LaSalle invariance principle, we find a bound on the algorithm step size that guarantees asymptotic convergence for agents subject to time-varying interactions. Several simulations illustrate the algorithm performance.