A Finite Memory Interacting P\'{o}lya Contagion Network and its Approximating Dynamical Systems
Somya Singh, Fady Alajaji, Bahman Gharesifard

TL;DR
This paper introduces a novel network model for contagion spread using finite memory Pólya urns, analyzes its stochastic properties, and develops dynamical system approximations to understand infection dynamics.
Contribution
It proposes a new finite memory interacting Pólya urn network model and derives both exact and approximate dynamical systems for contagion analysis.
Findings
Characterized the limiting infection state for homogeneous parameters.
Derived linear and nonlinear dynamical systems for different memory modes.
Validated approximations through simulation studies.
Abstract
We introduce a new model for contagion spread using a network of interacting finite memory two-color P\'{o}lya urns, which we refer to as the finite memory interacting P\'{o}lya contagion network. The urns interact in the sense that the probability of drawing a red ball (which represents an infection state) for a given urn, not only depends on the ratio of red balls in that urn but also on the ratio of red balls in the other urns in the network, hence accounting for the effect of spatial contagion. The resulting network-wide contagion process is a discrete-time finite-memory (th order) Markov process, whose transition probability matrix is determined. The stochastic properties of the network contagion Markov process are analytically examined, and for homogeneous system parameters, we characterize the limiting state of infection in each urn. For the non-homogeneous case, given the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
