Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
An introduction to genetic algorithms
An introduction to genetic algorithms
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Why simulating evolutionary processes is just as interesting as applying them
GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
Why simulating evolutionary processes is just as interesting as applying them
GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
Stability in the self-organized evolution of networks
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Modeling and Designing Real---World Networks
Algorithmics of Large and Complex Networks
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
| Hi-index | 0.00 |
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.