Stability in the Self-Organized Evolution of Networks

被引:0
|
作者
Jansen, Thomas [1 ]
Theile, Madeleine [2 ]
机构
[1] Univ Dortmund, FB Informat, LS 2, D-44221 Dortmund, Germany
[2] Univ Dortmund, FB Math, D-44221 Dortmund, Germany
关键词
evolutionary algorithms; self-organization; stability; run time analysis;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The modeling and analysis of large networks of autonomous agents is art important topic with applications in many different, disciplines. One way of modeling the development, of such networks is by means of all 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.
引用
收藏
页码:931 / +
页数:2
相关论文
共 50 条