Stability in the self-organized evolution of networks

The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such networks is by means of an evolutionary process. The autonomous agents are randomly chosen to become active, may apply some kind of local mutation operators to the network and decide about accepting these changes via some fitness-based selection whereas the fitness models the agent’s preferences. This general framework for the self-organized evolution of networks can be instantiated in many different ways. For interesting instances, one would like to know whether stable topologies eventually evolve and how long this process may take. Here, known results for one instantiation are improved. Moreover, a more natural and local instantiation is presented and analyzed with respect to the expected time needed to reach a stable state. Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem ...

• Type: Conference
• Year: 2007
• Where: GECCO
• Authors: Thomas Jansen, Madeleine Theile
• Keywords: Autonomous Agents, GECCO 2007, Keywords Evolutionary Algorithms, Local Mutation Operators