Small World Properties Generated by a New Algorithm Under Same Degree of All Nodes  

作　　者：LI Yong FANG Jin-Qing LIU Qiang LIANG Yong 

机构地区：[1]China Institute of Atomic Energy, P.O. Box 275-81, Beijing 102413, China

出　　处：《Communications in Theoretical Physics》2006年第5期950-954,共5页理论物理通讯（英文版）

基　　金：The project supported by the Key Project5 of National Natural Science Foundation of China under Grant No 70431002, and National Natural Science Foundation of China under Grant Nos. 70371068 and 10247005

摘　　要：Based on the model of the same degree of all nodes we proposed before, a new algorithm, the so-called “spread all over vertices” （SAV） algorithm, is proposed for generating small-world properties from a regular ring lattices. During randomly rewiring connections the SAV is used to keep the unchanged number of links. Comparing the SAV algorithm with the Watts-Strogatz model and the “spread all over boundaries” algorithm, three methods can have the same topological properties of the small world networks. These results offer diverse formation of small world networks. It is helpful to the research of some applications for dynamics of mutual oscillator inside nodes and interacting automata associated with networks.

关 键 词：small world network the same degree of all nodes in the network “spread all over vertices”algorithm average shortest path length average clustering coefficient 

分 类 号：O415[理学—理论物理]