Skip to main content
SpringerLink
Log in
Book cover

International Conference on Cellular Automata

ACRI 2012: Cellular Automata pp 224–233Cite as

Network View of Binary Cellular Automata

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7495))

Abstract

The network view of cellular automata focuses on the effective relationships between cells rather than the states themselves. In this article, we review a network representation presented in previous papers and present network graphs derived from all independent rules of one-dimensional elementary cellular automata and totalistic five-neighbor cellular automata. Removal of the transient effects of initial configurations improves the visibility of the dynamical characteristics of each rule. Power-law distributions of lifetimes and sizes of avalanches caused by one-cell perturbations of an attractor are exhibited by the derived network of Rule 11 (or 52) of totalistic five-neighbor cellular automata.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. von Neumann, J.: The theory of self-reproducing automata. In: Burks, A.W. (ed.) Essays on Cellular Automata. University of Illinois Press (1966)

    Google Scholar 

  2. Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55, 601–644 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  3. Gardner, M.: Mathematical games. Scientific American 223, 120–123 (1970)

    Article  Google Scholar 

  4. Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for Your Mathematical Plays, vol. 2. Academic Press, New York (1982)

    MATH  Google Scholar 

  5. Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)

    Article  Google Scholar 

  6. Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  7. Kayama, Y.: Complex networks derived from cellular automata. arXiv:1009.4509 (2010)

    Google Scholar 

  8. Kayama, Y.: Network representation of cellular automata. In: 2011 IEEE Symposium on Artificial Life (IEEE ALIFE 2011) at SSCI 2011, pp. 194–202 (2011)

    Google Scholar 

  9. Kayama, Y., Imamura, Y.: Network representation of the game of life. Journal of Artificial Intelligence and Soft Computing Research 1 (3), 233–240 (2011)

    Google Scholar 

  10. Bak, P., Tang, C., Wiesenfeld, K.: Self-organized criticality: an explanation of 1/f noise. Physical Review Letters 59 (4), 381–384 (1987)

    Article  MathSciNet  Google Scholar 

  11. Bak, P., Chen, K., Creutz, M.: Self-organized criticality in the ’game of life’. Nature (London) 342, 780 (1989)

    Article  Google Scholar 

  12. Kayama, Y.: Network representation of the game of life and self-organized criticality (extended abstract). To be appeared in the Proceedings of the 13th International Conference on the Simulation & Synthesis of Living Systems (2012)

    Google Scholar 

  13. Wolfram, S.: A New Kind of Science. Wolfram Media, Inc. (2002)

    Google Scholar 

  14. Callahan, P.: Patterns, programs, and links for conway’s game of life (1995), http://www.radicaleye.com/lifepage/ (retrieved at February 1, 2011)

  15. Flammenkamp, A.: Achim’s game of life page (1998), http://wwwhomes.uni-bielefeld.de/achim/gol.html (retrieved at December 12, 2011)

  16. Kayama, Y.: Network View of Conway’s Game of Life. Wolfram Demonstrations Project (2012), http://demonstrations.wolfram.com/NetworkViewOfConwaysGameOfLife/

  17. Latora, V., Marchiori, M.: Efficient behavior of small-world networks. Phys. Rev. Lett. 87, 198701–198704 (2001)

    Article  Google Scholar 

  18. Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.U.: Complex networks: Structure and dynamics. Physics Reports 424, 175–308 (2006)

    Article  MathSciNet  Google Scholar 

  19. Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press (1994)

    Google Scholar 

  20. Fagiolo, G.: Clustering in complex directed networks. Phys. Rev. E 76, 026107–026114 (2007)

    Google Scholar 

  21. Clauset, A., Shalizi, C.R., Newman, M.E.J.: Power-law distributions in empirical data. SIAM Review 51, 661–703 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Media and Information, BAIKA Women’s University, 2-19-5 Shukuno-sho, Ibaraki, 567-8578, Osaka, Japan

    Yoshihiko Kayama

Authors
  1. Yoshihiko Kayama
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, Laboratory of Electronics, Democritus University of Thrace, GR 67100, Xanthi, Greece

    Georgios Ch. Sirakoulis

  2. CSAI - Complex Systems and Artificial Intelligence Research Center, University of Milano-Bicocca, 20134, Milano, Italy

    Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kayama, Y. (2012). Network View of Binary Cellular Automata. In: Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2012. Lecture Notes in Computer Science, vol 7495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33350-7_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33350-7_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33349-1

  • Online ISBN: 978-3-642-33350-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation