Mean-field approximations for homogeneous networks

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As seen in Chapters 2 and 3, because of the high-dimensionality of exact mathematical models describing spreading processes on networks, the models are often neither tractable nor numerically solvable for networks of realistic size. We can avoid this fundamental difficulty by refocusing our attention on expected population-scale quantities, such as the expected prevalence or the expected number of edges where one node is susceptible while the other is infectious. This opens up a range of possibilities to formulate so-called mean-field models (i.e. typically low-dimensional ODEs or PDEs) that are widespread in the physics and mathematical biology literature. These are used to approximate stochastic processes, with the potential to be exact in the large system or “thermodynamic” limit, see (for example, [151, 166, 167, 243] and the literature overview in Section 4.8).

Cite

CITATION STYLE

APA

Kiss, I. Z., Miller, J. C., & Simon, P. L. (2017). Mean-field approximations for homogeneous networks. In Interdisciplinary Applied Mathematics (Vol. 46, pp. 117–164). Springer Nature. https://doi.org/10.1007/978-3-319-50806-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free