Approximations for Stochastic Graph Rewriting
In this note we present a method to compute approximate descriptions of a class of stochastic systems. For the method to apply, the system must be presented as a Markov chain on a state space consisting in graphs or graph-like objects, and jumps must be described by transformations which follow a finite set of local rules.
Unable to display preview. Download preview PDF.
- 2.Gleeson, J.P.: High-accuracy approximation of binary-state dynamics on networks. Physical Review Letters 107(6), 068701 (2011)Google Scholar
- 3.Harmer, R., Danos, V., Feret, J., Krivine, J., Fontana, W.: Intrinsic information carriers in combinatorial dynamical systems. Chaos 20(3) (2010)Google Scholar
- 4.Norris, J.R.: Markov chains. Cambridge series in statistical and probabilistic mathematics. Cambridge University Press (1998)Google Scholar