Rate Equations for Graphs

by   Vincent Danos, et al.

In this paper, we combine ideas from two different scientific traditions: 1) graph transformation systems (GTSs) stemming from the theory of formal languages and concurrency, and 2) mean field approximations (MFAs), a collection of approximation techniques ubiquitous in the study of complex dynamics. Using existing tools from algebraic graph rewriting, as well as new ones, we build a framework which generates rate equations for stochastic GTSs and from which one can derive MFAs of any order (no longer limited to the humanly computable). The procedure for deriving rate equations and their approximations can be automated. An implementation and example models are available online at https://rhz.github.io/fragger. We apply our techniques and tools to derive an expression for the mean velocity of a two-legged walker protein on DNA.



There are no comments yet.


page 1

page 2

page 3

page 4


Variational Approximations between Mean Field Theory and the Junction Tree Algorithm

Recently, variational approximations such as the mean field approximatio...

On Numerical approximations of fractional and nonlocal Mean Field Games

We construct numerical approximations for Mean Field Games with fraction...

Efficient stochastic algorithms for agent-based models with predator-prey dynamics

Experiments in predator-prey systems show the emergence of long-term cyc...

Mean Field and Refined Mean Field Approximations for Heterogeneous Systems: It Works!

Mean field approximation is a powerful technique to study the performanc...

Signal propagation in continuous approximations of binary neural networks

The training of stochastic neural network models with binary (±1) weight...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.