Beyond clustering: mean-field dynamics on networks with arbitrary subgraph composition

DOI10.1007/S00285-015-0884-1zbMATH Open1330.05146arXiv1405.6234OpenAlexW3106311744WikidataQ41041016 ScholiaQ41041016MaRDI QIDQ907124FDOQ907124

Luc Berthouze, Istvan Z. Kiss, Martin Ritchie

Publication date: 2 February 2016

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

Abstract: Clustering is the propensity of nodes that share a common neighbour to be connected. It is ubiquitous in many networks but poses many modelling challenges. Clustering typically manifests itself by a higher than expected frequency of triangles, and this has led to the principle of constructing networks from such building blocks. This approach has been generalised to networks being constructed from a set of more exotic subgraphs. As long as these are fully connected, it is then possible to derive mean-field models that approximate epidemic dynamics well. However, there are virtually no results for non-fully connected subgraphs. In this paper, we provide a general and automated approach to deriving a set of ordinary differential equations, or mean-field model, that describes, to a high degree of accuracy, the expected values of system-level quantities, such as the prevalence of infection. Our approach offers a previously unattainable degree of control over the arrangement of subgraphs and network characteristics such as classical node degree, variance and clustering. The combination of these features makes it possible to generate families of networks with different subgraph compositions while keeping classical network metrics constant. Using our approach, we show that higher-order structure realised either through the introduction of loops of different sizes or by generating clustered networks based on different subgraphs, leads to significant differences in epidemic dynamics despite controlling for basic network metrics.

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

zbMATH Keywords

networkmotifepidemicsubgraphhigh-order structure

Mathematics Subject Classification ID

Applications of continuous-time Markov processes on discrete state spaces (60J28) Dynamical systems in biology (37N25) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Emergence of Scaling in Random Networks
• A critical point for random graphs with a given degree sequence
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• SIR dynamics in random networks with heterogeneous connectivity
• Analysis of a stochastic SIR epidemic on a random network incorporating household structure
• Large-scale properties of clustered networks: implications for disease dynamics
• Higher-order structure and epidemic dynamics in clustered networks
• GENERALIZED NETWORK CLUSTERING AND ITS DYNAMICAL IMPLICATIONS
• A note on a paper by Erik Volz: SIR dynamics in random networks
• Stochastic multitype SIR epidemics among a population partitioned into households
• An SIR epidemic model on a population with random network and household structure, and several types of individuals
• A motif-based approach to network epidemics
• Exact deterministic representation of Markovian SIR epidemics on networks with and without loops

Cited In (3)

• Flows in complex networks: theory, algorithms, and application to lennard-Jones cluster rearrangement
• Compact pairwise models for epidemics with multiple infectious stages on degree heterogeneous and clustered networks
• Epidemic threshold in pairwise models for clustered networks: closures and fast correlations

This page was built for publication: Beyond clustering: mean-field dynamics on networks with arbitrary subgraph composition

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