Rejection-Based Simulation of Non-Markovian Agents on Complex Networks
Stochastic models in which agents interact with their neighborhood according to a network topology are a powerful modeling framework to study the emergence of complex dynamic patterns in real-world systems. Stochastic simulations are often the preferred—sometimes the only feasible—way to investigate such systems. Previous research focused primarily on Markovian models where the random time until an interaction happens follows an exponential distribution.
In this work, we study a general framework to model systems where each agent is in one of several states. Agents can change their state at random, influenced by their complete neighborhood, while the time to the next event can follow an arbitrary probability distribution. Classically, these simulations are hindered by high computational costs of updating the rates of interconnected agents and sampling the random residence times from arbitrary distributions.
We propose a rejection-based, event-driven simulation algorithm to overcome these limitations. Our method over-approximates the instantaneous rates corresponding to inter-event times while rejection events counter-balance these over-approximations. We demonstrate the effectiveness of our approach on models of epidemic and information spreading.
KeywordsGillespie simulation Complex networks Epidemic modeling Rejection sampling Multi-agent system
We thank Guillaume St-Onge for helpful comments on non-Markovian dynamics. This research was been partially funded by the German Research Council (DFG) as part of the Collaborative Research Center “Methods and Tools for Understanding and Controlling Privacy”.
- 4.Kiss, I.Z., Miller, J.C., Simon, P.L.: Mathematics of Epidemics on Networks. Forthcoming in Springer TAM Series, Cham (2016)Google Scholar
- 6.Rodrigues, H.S.: Application of SIR epidemiological model: new trends. arXiv preprint. arXiv:1611.02565 (2016)
- 25.St-Onge, G., Young, J.-G., Hébert-Dufresne, L., Dubé, L.J.: Efficient sampling of spreading processes on complex networks using a composition and rejection algorithm. arXiv preprint. arXiv:1808.05859 (2018)
- 27.Cox, D.R.: Renewal Theory (1962)Google Scholar
- 28.Pasupathy, R.: Generating Homogeneous Poisson Processes. Wiley Encyclopedia of Operations Research and Management Science, Hoboken (2010)Google Scholar
- 31.Jo, H.-H., Perotti, J.I., Kaski, K., Kertész, J.: Analytically solvable model of spreading dynamics with non-Poissonian processes. Phys. Rev. X 4(1), 011041 (2014)Google Scholar
- 32.Sherborne, N., Miller, J.C., Blyuss, K.B., Kiss, I.Z.: Mean-field models for non-Markovian epidemics on networks: from edge-based compartmental to pairwise models. arXiv preprint. arXiv:1611.04030 2016
- 35.Großmann, G., Bortolussi, L., Wolf, V.: Rejection-based simulation of non-Markovian agents on complex networks. arxiv.org/abs/1910.03964 (2019)
- 37.Dassios, A., Zhao, H., et al.: Exact simulation of Hawkes process with exponentially decaying intensity. Electron. Commun. 18 (2013)Google Scholar
- 39.Röst, G., Vizi, Z., Kiss, I.Z.: Impact of non-Markovian recovery on network epidemics. In: BIOMAT 2015: International Symposium on Mathematical and Computational Biology, pp. 40–53. World Scientific (2016)Google Scholar
- 41.Jo, H.-H., Lee, B.-H., Hiraoka, T., Jung, W.-S.: Copula-based algorithm for generating bursty time series. arXiv preprint. arXiv:1904.08795 (2019)