The end time of SIS epidemics driven by random walks on edge-transitive graphs

DOI10.1007/S10955-020-02547-7MaRDI QIDQ2183153zbMATHOpenAlexFDO

Authors Daniel R. Figueiredo, Giulio Iacobelli, V. Shneer

Publication date 26 May 2020

Published in Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1903.09178

zbMATH Keywords

random walksSIS modelnetwork epidemics

Mathematics Subject Classification ID

Epidemiology (92D30) Random graphs (graph-theoretic aspects) (05C80) Social networks; opinion dynamics (91D30) Anomalous diffusion models (subdiffusion, superdiffusion, continuous-time random walks, etc.) (60K50)

Abstract: Network epidemics is a ubiquitous model that can represent different phenomena and finds applications in various domains. Among its various characteristics, a fundamental question concerns the time when an epidemic stops propagating. We investigate this characteristic on a SIS epidemic induced by agents that move according to independent continuous time random walks on a finite graph: Agents can either be infected (I) or susceptible (S), and infection occurs when two agents with different epidemic states meet in a node. After a random recovery time, an infected agent returns to state S and can be infected again. The End of Epidemic (EoE) denotes the first time where all agents are in state S, since after this moment no further infections can occur and the epidemic stops. For the case of two agents on edge-transitive graphs, we characterize EoE as a function of the network structure by relating the Laplace transform of EoE to the Laplace transform of the meeting time of two random walks. Interestingly, this analysis shows a separation between the effect of network structure and epidemic dynamics. We then study the asymptotic behavior of EoE (asymptotically in the size of the graph) under different parameter scalings, identifying regimes where EoE converges in distribution to a proper random variable or to infinity. We also highlight the impact of different graph structures on EoE, characterizing it under complete graphs, complete bipartite graphs, and rings.

Recommendations

• A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
• Viral processes by random walks on random regular graphs
• SIR epidemics on random graphs with a fixed degree sequence
• Spread of epidemics and rumours with mobile agents
• Viral processes by random walks on random regular graphs

Cites work

• scientific article; zbMATH DE number 790938 (Why is no real title available?)
• A Random Walk Epidemic Simulation
• A phase transition in a model for the spread of an infection
• A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
• A shape theorem for the spread of an infection
• Absorbing-state transition for stochastic sandpiles and activated random walks
• Activated random walkers: facts, conjectures and challenges
• Collisions Among Random Walks on a Graph
• Contact interactions on a lattice
• Epidemics and rumours in complex networks.
• Epidemics in adaptive social networks with temporary link deactivation
• Epidemics of random walkers in metapopulation model for complete, cycle, and star graphs
• Exact computation for meeting times and infection times of random walks on graphs
• Frogs on trees?
• Network science. With Márton Pósfai
• On an epidemic model on finite graphs
• Phase transition for the frog model
• Random walks on a complete graph: a model for infection
• The contact process on trees
• The spread of a rumor or infection in a moving population
• Viral processes by random walks on random regular graphs

Cited in

(2)

• A computational framework for evaluating the role of mobility on the propagation of epidemics on point processes
• Migration–contagion processes

This page was built for publication: The end time of SIS epidemics driven by random walks on edge-transitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183153)