Abstract
Complex networks play an important role in human society and in nature. Stochastic multistate processes provide a powerful framework to model a variety of emerging phenomena such as the dynamics of an epidemic or the spreading of information on complex networks. In recent years, mean-field type approximations gained widespread attention as a tool to analyze and understand complex network dynamics. They reduce the model’s complexity by assuming that all nodes with a similar local structure behave identically. Among these methods the approximate master equation (AME) provides the most accurate description of complex networks’ dynamics by considering the whole neighborhood of a node. The size of a typical network though renders the numerical solution of multistate AME infeasible. Here, we propose an efficient approach for the numerical solution of the AME that exploits similarities between the differential equations of structurally similar groups of nodes. We cluster a large number of similar equations together and solve only a single lumped equation per cluster. Our method allows the application of the AME to real-world networks, while preserving its accuracy in computing estimates of global network properties, such as the fraction of nodes in a state at a given time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
- 2.
We omit t for the ease of notation.
- 3.
We omit once more t for easiness.
- 4.
References
Barabási, A.-L.: Network Science. Cambridge University Press, Cambridge (2016)
Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
Barrat, A., Barthelemy, M., Vespignani, A.: Dynamical Processes on Complex Networks. Cambridge University Press, Cambridge (2008)
Bortolussi, L., Hillston, J., Latella, D., Massink, M.: Continuous approximation of collective system behaviour: a tutorial. Perform. Eval. 70(5), 317–349 (2013)
Brauer, F.: Mathematical epidemiology: past, present, and future. Infect. Dis. Model. 2(2), 113–127 (2017)
Buchholz, P.: Exact and ordinary lumpability in finite markov chains. J. Appl. Probab. 31(1), 59–75 (1994)
Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: ERODE: a tool for the evaluation and reduction of ordinary differential equations. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 310–328. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-662-54580-5_19
Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Syntactic markovian bisimulation for chemical reaction networks. In: Aceto, L., Bacci, G., Bacci, G., Ingólfsdóttir, A., Legay, A., Mardare, R. (eds.) Models, Algorithms, Logics and Tools. LNCS, vol. 10460, pp. 466–483. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-63121-9_23
Castellano, C., Pastor-Satorras, R.: Thresholds for epidemic spreading in networks. Phys. Rev. Lett. 105(21), 218701 (2010)
Cator, E., Van Mieghem, P.: Second-order mean-field susceptible-infected-susceptible epidemic threshold. Phys. Rev. E 85(5), 056111 (2012)
Cota, W., Ferreira, S.C.: Optimized gillespie algorithms for the simulation of markovian epidemic processes on large and heterogeneous networks. Comput. Phys. Commun. 219, 303–312 (2017)
Demirel, G., Vazquez, F., Böhme, G.A., Gross, T.: Moment-closure approximations for discrete adaptive networks. Physica D 267, 68–80 (2014)
Fedewa, N., Krause, E., Sisson, A.: Spread of a rumor. In: Society for Industrial and Applied Mathematics. Central Michigan University, vol. 25 (2013)
Fennell, P.G.: Stochastic processes on complex networks: techniques and explorations. Ph.D. thesis, University of Limerick (2015)
Fosdick, B.K., Larremore, D.B., Nishimura, J., Ugander, J.: Configuring random graph models with fixed degree sequences. arXiv preprint arXiv:1608.00607 (2016)
Gleeson, J.P.: High-accuracy approximation of binary-state dynamics on networks. Phys. Rev. Lett. 107(6), 068701 (2011)
Gleeson, J.P.: Binary-state dynamics on complex networks: pair approximation and beyond. Phys. Rev. X, 3(2), 021004 (2013)
Gleeson, J.P., Melnik, S., Ward, J.A., Porter, M.A., Mucha, P.J.: Accuracy of mean-field theory for dynamics on real-world networks. Phys. Rev. E 85(2), 26106 (2012)
Kiss, I.Z., Miller, J.C., Simon, P.L.: Mathematics of epidemics on networks: from exact to approximate models. In: Forthcoming in Springer TAM series. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-319-50806-1
Kyriakopoulos, C., Grossmann, G., Wolf, V., Bortolussi, L.: Lumping of degree-based mean-field and pair-approximation equations for multistate contact processes. Phys. Rev. E 97(1), 012301 (2018)
Li, G., Rabitz, H.: A general analysis of approximate lumping in chemical kinetics. Chem. Eng. Sci. 45(4), 977–1002 (1990)
Masuda, N., Konno, N.: Multi-state epidemic processes on complex networks. J. Theor. Biol. 243(1), 64–75 (2006)
Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167–256 (2003)
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., Vespignani, A.: Epidemic processes in complex networks. Rev. Mod. Phys. 87(3), 925 (2015)
Pastor-Satorras, R., Vespignani, A.: Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86(14), 3200 (2001)
Porter, M., Gleeson, J.: Dynamical Systems on Networks: A Tutorial, vol. 4. Springer, Switzerland (2016). https://doi.org/10.1007/978-3-319-26641-1
Simon, P.L., Taylor, M., Kiss, I.Z.: Exact epidemic models on graphs using graph-automorphism driven lumping. J. Math. Biol. 62(4), 479–508 (2011)
Wei, J., Kuo, J.C.W.: Lumping analysis in monomolecular reaction systems. analysis of the exactly lumpable system. Ind. Eng. Chem. Fundam. 8(1), 114–123 (1969)
Acknowledgments
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”. We thank James P. Gleeson for his comments regarding the performance of AME on specific models and Michael Backenköhler for his comments on the manuscript.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Großmann, G., Kyriakopoulos, C., Bortolussi, L., Wolf, V. (2018). Lumping the Approximate Master Equation for Multistate Processes on Complex Networks. In: McIver, A., Horvath, A. (eds) Quantitative Evaluation of Systems. QEST 2018. Lecture Notes in Computer Science(), vol 11024. Springer, Cham. https://doi.org/10.1007/978-3-319-99154-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-99154-2_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99153-5
Online ISBN: 978-3-319-99154-2
eBook Packages: Computer ScienceComputer Science (R0)