Stability of Spreading Processes over Time-Varying Large-Scale Networks


In this paper, we analyze the dynamics of spreading processes taking place over time-varying networks. A common approach to model time-varying networks is via Markovian random graph processes. This modeling approach presents the following limitation: Markovian random graphs can only replicate switching patterns with exponential inter-switching times, while in real applications these times are usually far from exponential. In this paper, we introduce a flexible and tractable extended family of processes able to replicate, with arbitrary accuracy, any distribution of inter-switching times. We then study the stability of spreading processes in this extended family. We first show that a direct analysis based on Itô's formula provides stability conditions in terms of the eigenvalues of a matrix whose size grows exponentially with the number of edges. To overcome this limitation, we derive alternative stability conditions involving the eigenvalues of a matrix whose size grows linearly with the number of nodes. Based on our results, we also show that heuristics based on aggregated static networks approximate the epidemic threshold more accurately as the number of nodes grows, or the temporal volatility of the random graph process is reduced. Finally, we illustrate our findings via numerical simulations.

DOI: 10.1109/TNSE.2016.2516346

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@article{Ogura2016StabilityOS, title={Stability of Spreading Processes over Time-Varying Large-Scale Networks}, author={Masaki Ogura and Victor M. Preciado}, journal={IEEE Transactions on Network Science and Engineering}, year={2016}, volume={3}, pages={44-57} }