2006/10/20 by YunFeng Chang, Chang, YunFeng, Long Guo +3
Physics and Astronomy · #Adaptation and Self-Organizing Systems (nlin.AO) #FOS: Physical sciences #nlin.AO
paper · pdf · doi:10.48550/arxiv.nlin/0610047
8 pages, 5 figures
arxiv created 2006/10/31 · arxiv updated 2009/12/01
In this paper we propose a self-organized particle moving model on scale free network with the algorithm of the shortest path and preferential walk. The over-capacity property of the vertices in this particle moving system on complex network is studied from the holistic point of view. Simulation results show that the number of over-capacity vertices forms punctuated equilibrium processes as time elapsing, that the average number of over-capacity vertices under each local punctuated equilibrium process has power law relationship with the local punctuated equilibrium value. What's more, the number of over-capacity vertices has the bell-shaped temporal correlation and 1/f2 behavior. Finally, the average lifetime L(t) of particles accumulated before time t is analyzed to find the different roles of the shortest path algorithm and the preferential walk algorithm in our model.