skip to main content
10.1145/1068009.1068105acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
Article

Evolutionary algorithms for the self-organized evolution of networks

Published:25 June 2005Publication History

ABSTRACT

While the evolution of biological networks can be modeled sensefully as a series of mutation and selection, evolution of other networks such as the social network in a city or the network of streets in a country is not determined by selection since there is no alternative network with which these singular networks have to compete. Nonetheless, these singular networks do evolve due to dynamic changes of vertices and edges. In this article we present a formal, analyzable framework for the evolution of singular networks. We show that the careful design of adaptation rules can lead to the emergence of network topologies with satisfying performance in polynomial time while other adaptation rules yield exponential runtime. We further show by example how the framework could be applied to some ad-hoc communication scenarios.

References

  1. G. Box. Evolutionary operation: a method for increasing industrial productivity. Appl. Stat., 6(2):81--101, 1957.Google ScholarGoogle ScholarCross RefCross Ref
  2. P. Bremaud. Markov Chains - Gibbs Field, Monte Carlo Simulation, and Queues. Springer Verlag, 1st edition, 1999.Google ScholarGoogle Scholar
  3. A. Grama, G. Karypis, V. Kumar, and A. Gupta. An Introduction to Parallel Computing. Addison Wesley, 2nd edition, 2003.Google ScholarGoogle Scholar
  4. J. Holland. Adaptation in natural and artificial systems. Ann Arbor: The University of Michigan Press, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. H. Jeong, B. Tombor, R. Albert, Z. Oltvai, and A.-L. Barabási. The large-scale organization of metabolic networks. Nature, 407:651--654, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  6. F. Kuhn, T. Moscibroda, and R. Wattenhofer. Unit disk graph approximation. In Proc. DIALM-POMC 2004, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. K. Lehmann. Why simulating evolutionary processes is just as interesting as applying them. In Proc. GECCO 2005, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Milgram. The small world problem. Psychology Today, 1:61--67, 1967.Google ScholarGoogle Scholar
  9. M. Mitchell. An introduction to genetic algorithms. The MIT Press, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. I. Rechenberg. Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzoog, 1973.Google ScholarGoogle Scholar
  11. J. Scharnow, K. Tinnefeld, and I. Wegener. The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modeling and Algorithms, 4(3):349--366, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  12. A. Vázquez, A. Flammini, A. Maritan, and A. Vespignani. Modeling of protein interaction networks. Complexus, 1(1):38--44, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  13. D. Watts and S. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440--442, June 1998.Google ScholarGoogle ScholarCross RefCross Ref
  14. C. Witt. An analysis of the (μ+1) EA on simple pseudo-boolean functions. In Genetic and Evolutionary Computation - GECCO 2004, number 3103 in LNCS, pages 761--773. Springer, 2004.Google ScholarGoogle Scholar

Index Terms

  1. Evolutionary algorithms for the self-organized evolution of networks

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            GECCO '05: Proceedings of the 7th annual conference on Genetic and evolutionary computation
            June 2005
            2272 pages
            ISBN:1595930108
            DOI:10.1145/1068009

            Copyright © 2005 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 25 June 2005

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate1,669of4,410submissions,38%

            Upcoming Conference

            GECCO '24
            Genetic and Evolutionary Computation Conference
            July 14 - 18, 2024
            Melbourne , VIC , Australia

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader