Approximations for Stochastic Graph Rewriting

  • Vincent Danos
  • Tobias Heindel
  • Ricardo Honorato-Zimmer
  • Sandro Stucki
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8829)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Durrett, R., Gleeson, J.P., Lloyd, A.L., Mucha, P.J., Shi, F., Sivakoff, D., Socolar, J.E., Varghese, C.: Graph fission in an evolving voter model. Proceedings of the National Academy of Sciences 109(10), 3682–3687 (2012)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Gleeson, J.P.: High-accuracy approximation of binary-state dynamics on networks. Physical Review Letters 107(6), 068701 (2011)Google Scholar
  3. 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. 4.
    Norris, J.R.: Markov chains. Cambridge series in statistical and probabilistic mathematics. Cambridge University Press (1998)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Vincent Danos
    • 1
  • Tobias Heindel
    • 1
  • Ricardo Honorato-Zimmer
    • 1
  • Sandro Stucki
    • 2
  1. 1.School of InformaticsUniversity of EdinburghEdinburghUnited Kingdom
  2. 2.Programming Methods Laboratory, EPFLLausanneSwitzerland

Personalised recommendations