Skip to main content
SpringerLink
Log in

Evolution of Small-World Networks of Automata for Computation

  • Conference paper
Parallel Problem Solving from Nature - PPSN VIII (PPSN 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3242))

Included in the following conference series:

Abstract

We study an extension of cellular automata to arbitrary interconnection topologies for the majority problem. By using an evolutionary algorithm, we show that small-world network topologies consistently evolve from regular and random structures without being designed beforehand. These topologies have better performance than regular lattice structures and are easier to evolve, which could explain in part their ubiquity.

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

Access this chapter

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 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albert, R., Barabasi, A.-L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74, 47–97 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Capcarrère, M.S., Sipper, M., Tomassini, M.: Two-state, r=1 cellular automaton that classifies density. Physical Review Letters 77(24), 4969–4971 (1996)

    Article  Google Scholar 

  3. Dorronsoro, B., Alba, E., Giacobini, M., Tomassini, M.: The influence of grid shape and asynchronicity in cellular evolutionary algorithms. In: Congress on Evolutionary Computation (CEC 2004) (to appear)

    Google Scholar 

  4. Garzon, M. (ed.): Models of Massive Parallelism: Analysis of Cellular Automata and Neural Networks. Springer, Berlin (1995)

    MATH  Google Scholar 

  5. Kauffman, S.A.: The Origins of Order. Oxford University Press, New York (1993)

    Google Scholar 

  6. Land, M., Belew, R.K.: No perfect two-state cellular automata for density classification exists. Physical Review Letters 74(25), 5148–5150 (1995)

    Article  Google Scholar 

  7. Thomson Leighton, F.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo (1992)

    MATH  Google Scholar 

  8. Mitchell, M., Crutchfield, J.P., Hraber, P.T.: Evolving cellular automata to perform computations: Mechanisms and impediments. Physica D 75, 361–391 (1994)

    Article  MATH  Google Scholar 

  9. Mitchell, M., Hraber, P.T., Crutchfield, J.P.: Revisiting the edge of chaos: Evolving cellular automata to perform computations. Complex Systems 7, 89–130 (1993)

    MATH  Google Scholar 

  10. Serra, R., Villani, M.: Perturbing the regular topology of cellular automata: implications for the dynamics. In: Bandini, S., Chopard, B., Tomassini, M. (eds.) ACRI 2002. LNCS, vol. 2493, pp. 168–177. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Sipper, M.: Evolution of Parallel Cellular Machines: The Cellular Programming Approach. Springer, Heidelberg (1997)

    Google Scholar 

  12. Sipper, M., Ruppin, E.: Co-evolving architectures for cellular machines. Physica D 99, 428–441 (1997)

    Article  MATH  Google Scholar 

  13. Watts, D.J.: Small worlds: The Dynamics of Networks between Order and Randomness. Princeton University Press, Princeton (1999)

    Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Systems Department, University of Lausanne, Switzerland

    Marco Tomassini, Mario Giacobini & Christian Darabos

Authors
  1. Marco Tomassini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mario Giacobini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian Darabos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Birmingham, Birmingham, UK

    Xin Yao

  2. Automated Scheduling, Optimisation and Planning Group, School of Computer Science & IT, University of Nottingham, NG8 1BB, Nottingham, UK

    Edmund K. Burke

  3. Intelligent Systems Group Department of Computer Science and Artificial Intelligence, University of the Basque Country, Paseo Manuel de Lardizábal 1, 20018, San Sebastian, Donostia, Spain

    José A. Lozano

  4. University of the West of England, Bristol, United Kingdom

    Jim Smith

  5. GeNeura Team, Depto. Arquitectura y Tecnología de Computadores, Universidad de Granada, Spain

    Juan Julián Merelo-Guervós

  6. School of Computer Science, The University of Birmingham, B15 1TT, Edgbaston, Birmingham, UK

    John A. Bullinaria

  7. School of Computer Science, University of Birmingham, B15 2TT, Birmingham, Great Britain

    Jonathan E. Rowe

  8. School of Computer Science, University of Birmingham, United Kingdom

    Peter Tiňo

  9. School of Computer Science, The University of Birmingham, B15 2TT, Birmingham, UK

    Ata Kabán

  10. Faculty of Computer Science, Dortmund University of Technology, 44221, Dortmund, Germany

    Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tomassini, M., Giacobini, M., Darabos, C. (2004). Evolution of Small-World Networks of Automata for Computation. In: Yao, X., et al. Parallel Problem Solving from Nature - PPSN VIII. PPSN 2004. Lecture Notes in Computer Science, vol 3242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30217-9_68

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30217-9_68

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23092-2

  • Online ISBN: 978-3-540-30217-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation