• Corpus ID: 251252931

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

@inproceedings{Wuyts2021MeanfieldMO,
  title={Mean-field models of dynamics on networks via moment closure: an automated procedure},
  author={Bert Wuyts and Jan Sieber},
  year={2021}
}
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… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 13 REFERENCES

Progress in High-Dimensional Percolation and Random Graphs

Preface -- 1. Introduction and motivation -- 2. Fixing ideas: Percolation on a tree and branching random walk -- 3. Uniqueness of the phase transition -- 4. Critical exponents and the triangle

Data-driven Control of Agent-based Models: an Equation/Variable-free Machine Learning Approach

TLDR
An Equation/Variable free machine learning framework for the control of the collective dynamics of complex/multiscale systems modelled via microscopic/agent-based simulators is presented, demonstrating that the scheme is robust against numerical approximation errors and modelling uncertainty.

Random Walk: A Modern Introduction

TLDR
This text meets the need for a modern reference to the detailed properties of an important class of random walks on the integer lattice and is suitable for probabilists, mathematicians working in related fields, and for researchers in other disciplines who use random walks in modeling.

Interacting particle systems

2 The asymmetric simple exclusion process 20 2.1 Stationary measures and conserved quantities . . . . . . . . . . . . . . . . . . . 20 2.2 Currents and conservation laws . . . . . . . . . . . . . . .

Probabilistic reasoning in intelligent systems - networks of plausible inference

  • J. Pearl
  • Computer Science
    Morgan Kaufmann series in representation and reasoning
  • 1989
TLDR
The author provides a coherent explication of probability as a language for reasoning with partial belief and offers a unifying perspective on other AI approaches to uncertainty, such as the Dempster-Shafer formalism, truth maintenance systems, and nonmonotonic logic.

Emergence of nonlinear dynamics from spatial structure in tropical forest-grassland landscapes

It is thought that tropical forests can exist as an alternative stable state to savanna [1, 2]. Therefore, the cumulative effects of perturbation by climate change or human impact may lead to crossing

The Geometry of Ecological Interactions: Simplifying Spatial Complexity

TLDR
This volume, written by world experts in the field, gives detailed coverage of the main areas of development in spatial ecological theory, integrating a perspective from field ecology with novel methods for simplifying spatial complexity and offers a didactical treatment with a gradual increase in mathematical sophistication.

Chordal graph package

  • 2011

For an ER random network, the expected number of mnode loops and m-node chains (counting all ordered mtuples without repetition) are L(N ) =