Evolutionary motifs for the automated discovery of self-organizing dimer automata

Advances in Complex Systems

Volumn 15, Issue 8, 2012, Pages

  Arendt, Dustin ^a   Cao, Yang ^a  

^a Virginia Polytechnic Institute and State University   (United States)

Author keywords

Dimer automata; evolutionary algorithm; local structure; network motif; self organization

Indexed keywords

EID: 84869181845     PISSN: 02195259     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219525912500816     Document Type: Article

References (48)

1. Adachi, S., Peper, F. and Lee, J., Computation by asynchronously updating cellular automata, J. Stat. Phys. 114 (2004) 261-289. (Pubitemid 39015558)
2. Adamatzky, A., Voronoi-like partition of lattice in cellular automata, Math. Comput. Model. 23 (1996) 51-66. (Pubitemid 126663298)
3. Alon, U., Network motifs: Theory and experimental approaches, Nat. Rev. Genet. 8 (2007) 450-461. (Pubitemid 46789247)
4. Arendt, D. and Cao, Y., Effective GPU acceleration of large scale, asynchronous simulations on graphs, Adv. Complex Syst. 15 (2012) 1-20.
5. Arendt, D. and Cao, Y., Elastic dimer automata: Discrete, tunable models for complex systems, in Proc. 2012 Int. Conf. on Scientific Computing, eds. H. R. Arabnia, W. Sparato, L. D. Atlo, J. F. Nystrom, A. M. G. Solo and G. A. Gravvanis (Las Vegas, NV, USA, 2012).
6. Ashby, W. R., Principles of the self-organizing system, Principles of Self-Organization: Transactions of the University of Illinois Symposium, 1962, pp. 255-278.
7. Bak, P., Chen, K. and Tang, C., A forest-fire model and some thoughts on turbulence, Phys. Lett. A. 147 (1990) 297-300.
8. Bandini, S., Bonomi, A. and Vizzari, G., An analysis of different types and effects of asynchronicity in cellular automata update schemes, Nat. Comput. 11 (2012) 277-287.
9. Barkley, D., A model for fast computer-simulation of waves in excitable media, Phys-ica D 49 (1991) 61-70.
10. Bennett, C. H., On the nature and origin of complexity in discrete, homogeneous, locally-interacting systems, Fo u n d. P h y s. 16 (1986) 585-592.
11. Bennett, C. H., How to define complexity in physics, and why, Complexity, Entropy, and the Physics of Information, Vol. 8 (Westview press, 1990), pp. 137-148.
12. Bersini, H. and Detours, V., Asynchrony induces stability in cellular automata based models, in Artificial Life IV (MIT Press, MA, 1994), pp. 382-387.
13. Bramson, M. and Griffeath, D., Flux and fixation in cyclic particle systems, The Ann. Probab. 17 (1989) 26-45.
14. Cook, M., Universality in elementary cellular automata, Complex Syst. 15 (2004) 1-40. (Pubitemid 39203440)
15. Cornforth, D., Green, D. G., Newth, D. and Kirley, M., Ordered asynchronous processes in multi-agent systems, Physica D: Nonlinear Phenomena 204 (2005) 70-82. (Pubitemid 40683793)
16. Deb, K., Pratap, A., Agarwal, S. and Meyarivan, T., A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Trans. Evol. Comput. 6 (2002) 182-197. (Pubitemid 34555372)
17. Di Paolo, E. A., Rhythmic and non-rhythmic attractors in asynchronous random boolean networks, Biosystems 59 (2001) 185-195. (Pubitemid 32318530)
18. Fat̀es, N., Regnault, D., Schabanel, N. and Thierry, E., Asynchronous behavior of double-quiescent elementary cellular automata, LATIN 2006: Theoretical Informatics, 2006, pp. 455-466. (Pubitemid 43986628)
19. Feldman, D. and Crutchfield, J., Measures of statistical complexity: Why? Phys. Lett. A 238 (1998) 244-252. (Pubitemid 128392649)
20. Fisch, R., Gravner, J. and Griffeath, D., Threshold-range scaling of excitable cellular automata, Stat. Comput. 1 (1991) 23-39.
21. Frost, H. J. and Thompson, C. V., Computer simulation of grain growth, Curr. Opin. Solid State Mater. Sci. 1 (1996) 361-368. (Pubitemid 126407982)
22. Gerhardt, M., Schuster, H. and Tyson, J. J., A cellular automaton model of excitable media including curvature and dispersion, Science 247 (1990) 1563-1566. (Pubitemid 120031419)
23. Gershenson, C. and Heylighen, F., When can we call a system self-organizing? in Advances Artificial Life (Springer, 2003), pp. 606-614. (Pubitemid 37170938)
24. Glazier, J. A. and Weaire, D., The kinetics of cellular patterns, J. Phys. Condens. Matter. 4 (1992) 1867-1894.
25. Greenberg, J. M. and Hastings, S. P., Spatial patterns for discrete models of diffusion in excitable media, SIAM J. Appl. Math. 34 (1978) 515-523.
26. Huberman, B. A. and Glance, N. S., Evolutionary games and computer simulations, Proc. Natl. Acad. Sci. USA 90 (1993) 7716.
27. Ingerson, T. E. and Buvel, R. L., Structure in asynchronous cellular automata, Phys-ica D: Nonlinear Phenomena 10 (1984) 59-68.
28. Jimeńez-Morales, F., An evolutionary approach to the study of non-trivial collective behavior in cellular automata, in C el lul ar Automata, Proceedi ngs, eds. Bandini, S., Chopard, B. and Tomassini, M., Lecture Notes in Computer Science, Vol. 2493 (Springer-Verlag, Berlin, 2002), pp. 32-43.
29. Kuperman, M. and Abramson, G., Small world effect in an epidemiological model, Phys. Rev. Lett. 86 (2001) 2909-2912. (Pubitemid 32293415)
30. Langton, C. G., Computation at the edge of chaos - phase-transitions and emergent computation, Physica D 42 (1990) 12-37.
31. Liggett, T. M., Stochastic models for large interacting systems and related correlation inequalities, Proc. Natl. Acad. Sci. USA 107 (2010) 16413-16419.
32. Lindenmayer, A., Mathematical models for cellular interactions in development I. Filaments with one-sided inputs, J. Theor. Biol. 18 (1968) 280-299.
33. Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D. and Alon, U., Network motifs: Simple building blocks of complex networks, Science 298 (2002) 824-827. (Pubitemid 35231534)
34. Mitchell, M., An Introduction to Genetic Algorithms (The MIT Press, 1998).
35. Mitchell, M., Crutchfield, J. P. and Das, R., Evolving cellular automata with genetic algorithms: A review of recent work, in Proc. First International Conference on Evolutionary Computation and its Applications (EvCA'96). Russian Academy of Sciences (1996).
36. Narbel, P., Qualitative and quantitative cellular automata from differential equations, in Cellular Automata, eds. El Yacoubi, S., Chopard, B. and Bandini, S., Lecture Notes in Computer Science, Vol. 4173 (Springer Berlin/Heidelberg, 2006), pp. 112-121. (Pubitemid 44608775)
37. Nehaniv, C. L., Asynchronous automata networks can emulate any synchronous automata network, Int. J. Algebra Comput. 5 (2004) 719-739. (Pubitemid 40144885)
38. Schiff, J. L., Cellular Automata: A Discrete View of the World (Wiley-Interscience, Hoboken, NJ, 2008).
39. Scḧonfisch, B. and de Roos, A., Synchronous and asynchronous updating in cellular automata, Biosystems 51 (1999) 123-143. (Pubitemid 29421683)
40. Scḧonfisch, B. and Hadeler, K. P., Dimer automata and cellular automata, Physica D 94 (1996) 188-204. (Pubitemid 126687345)
41. Shalizi, C., Haslinger, R., Rouquier, J., Klinkner, K. and Moore, C., Automatic filters for the detection of coherent structure in spatiotemporal systems, Phys. Rev. E 73 (2006) 036104.
42. Shalizi, C. R., Shalizi, K. L. and Haslinger, R., Quantifying self-organization with optimal predictors, Phy. Rev. Lett. 93 (2004) 118701.
43. Suzudo, T., Searching for pattern-forming asynchronous cellular automata - an evolutionary approach, in Cel l ular Autom ata, Proceedi ngs, eds. Sloot, P., Chopard, B. and Hoekstra, A., Lecture Notes in Computer Science, Vol. 3305 (Springer-Verlag, Berlin, 2004), pp. 151-160. (Pubitemid 39742828)
44. Suzudo, T., Spatial pattern formation in asynchronous cellular automata with mass conservation, Physica A 343 (2004) 185-200.
45. Tan, S. K. and Guan, S.-U., Evolving cellular automata to generate nonlinear sequences with desirable properties, Appl. Soft Comput. 7 (2007) 1131-1134. (Pubitemid 46551938)
46. Vanneschi, L. and Mauri, G., A study on learning robustness using asynchronous 1d cellular automata rules, Nat. Comput. 11 (2012) 289-302.
47. Wolfram, S., A New Kind of Science (Wolfram Media, Inc., 2002).
48. Wolz, D. and de Oliveira, P. P., Very effective evolutionary techniques for searching cellular automata rule spaces, J. Cellular Automata 3 (2008) 289-312.