Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2111.07643

Mean-field models of dynamics on networks via moment closure: an automated procedure

Bert Wuyts·Jan Sieber
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the study of dynamics on networks, moment closure is a commonly used method to obtain low-dimensional evolution equations amenable to analysis. The variables in the evolution equations are mean counts of subgraph states and are referred to as moments. Due to interaction between neighbours, each moment equation is a function of higher-order moments, such that an infinite hierarchy of equations arises. Hence, the derivation requires truncation at a given order, and, an approximation of the highest-order moments in terms of lower-order ones,known as a closure formula. Recent systematic approximations have either restricted focus to closed moment equations for SIR epidemic spreading or to unclosed moment equations for arbitrary dynamics. In this paper, we develop a general procedure that automates both derivation and closure of arbitrary order moment equations for dynamics with nearest-neighbour interactions on undirected networks. Automation of the closure step was made possible by our generalised closure scheme,which systematically decomposes the largest subgraphs into their smaller components.We show that this decomposition is exact if these components form a tree, there is independence at distances beyond their graph diameter, and there is spatial homogeneity. Testing our method for SIS epidemic spreading on lattices and random networks confirms that biases are larger for networks with many short cycles in regimes with long-range dependence. A Mathematica package that automates the moment closure is available for download.

Explore related subjects

math.DS

Keep this discovery

BibTeXRIS

Bert Wuyts, Jan Sieber. 2021-11-15. Mean-field models of dynamics on networks via moment closure: an automated procedure. https://doi.org/10.1103/physreve.106.054312

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Admissible Fourier Lengths, KAM Reducibility, and Spectral Applications

We develop a perturbative KAM reducibility theory for one-frequency $\mathrm{SL}(2,\mathbb{R})$ cocycles based on an admissible Fourier length $\ell$. The regularity relevant to the iteration is measured by positive adapted Fourier width rather than ordinary smoothness in the Euclidean length $|n|$. The same length governs Fourier decay, truncation and resonance scales, and the arithmetic condition controlling the small divisors. This framework contains the classical analytic and Gevrey settings, while non-monotone choices of $\ell$ allow classical nowhere differentiable Weierstrass-type perturbations and continuous perturbations outside every positive H\"older class. As spectral applications, we obtain purely absolutely continuous spectrum for every phase and $1/2$-H\"older continuity of the integrated density of states for the associated quasiperiodic Schr\"odinger operators. The Aubry dual has pure point spectrum for Lebesgue almost every dual phase, with eigenfunctions exponentially localized in the metric induced by $\ell$. We also construct nowhere differentiable quasiperiodic potentials with purely absolutely continuous Cantor spectrum.

math.DS↗
arXiv2026

Dynamics inside the attracting basins of some skew products

Polynomial skew products in $\mathbb{C}^2$ are maps of the form $F(z,w)=(P(z),Q(z,w))$, where $P$ and $Q$ are polynomials. Their local dynamics have been widely investigated. In this paper, we study the global dynamics inside Fatou components of some skew products. We consider all the inverse images in a Fatou component of a given point and use the Kobayashi metric to measure the distance between points. In the cases we consider, there are always arbitrarily large Kobayashi balls in the complement of these inverse sets.

math.DS↗
arXiv2026

Ergodicity of dynamical systems without uniqueness of orbits

Recently, there has been considerable interest in the study of non-deterministic dynamical systems. To analyze the chaotic behavior of such systems from a measure-theoretic viewpoint, it is desirable to consider ergodicity. However, the classical definition of ergodicity involves invariant sets, whose definition is not unique for non-deterministic dynamical systems. Thus, we are led to the question of which invariance yields an interesting definition of ergodicity. Here, we propose a definition based on the strong backward invariance and show that analogs of classical results hold. We also consider implications of the Birkhoff ergodic theorem for systems without uniqueness of orbits.

math.DS↗