Abstract
Contagious diseases can spread quickly in human populations, either through airborne transmission or if some other spreading vectors are abundantly accessible. They can be particularly devastating if the impact on individuals' health has severe consequences on the number of hospitalizations or even deaths. Common countermeasures to contain the epidemic spread include introducing restrictions on human interactions or their mobility in general which are often associated with an economic and social cost. In this paper, we present a targeted model of optimal social distancing on metapopulation networks, named ESIR model, which can effectively reduce the disease spreading and at the same time minimize the impact on human mobility and related costs. The proposed model is grounded in a nonlinear random walk process that considers the finite carrying capacity of the network's metanodes, the physical patches where individuals interact within mobility networks. This later constrain is modeled as a slack compartment E for the classic SIR model and quantifies the density of vacant spaces to accommodate the diffusing individuals. Formulating the problem as a multi-objective optimization problem shows that when the walkers avoid crowded nodes, the system can rapidly approach Pareto optimality, thus reducing the spreading considerably while minimzing the impact on human mobility as also validated in empirical transport networks. These results envisage ad hoc mobility protocols that can potentially enhance policy making for pandemic control.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.