Evolution of Small-World Networks of Automata for Computation
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.
Unable to display preview. Download preview PDF.
- 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
- 5.Kauffman, S.A.: The Origins of Order. Oxford University Press, New York (1993)Google Scholar
- 11.Sipper, M.: Evolution of Parallel Cellular Machines: The Cellular Programming Approach. Springer, Heidelberg (1997)Google Scholar
- 13.Watts, D.J.: Small worlds: The Dynamics of Networks between Order and Randomness. Princeton University Press, Princeton (1999)Google Scholar