High clustering coefficient of computer networks
Due to the rapid development of network technology, the structure of computer network is increasingly complicated. The traditional random network model is difficult to characterize the topology of current computer network. Complex network theory provides new view and thinking to study in this field. In this paper, we give a probabilistic model to examine the evolution of computer networks by random duplication processes of node degree as well as the preferential choice mechanisms. The model is solved exactly for large network. We demonstrate that both the degree distribution and the triangle distribution have stationary properties. When the size of the network tends to infinity, the degree distribution behaves as P(k) ∝ k-3 and the average clustering coefficient C is independent of the network size N.
Cai-Feng DU
College of Mathematics and Computational Science China University of Petroleum Dongying 257061, Shandong, China
国际会议
2009 WASE International Conference on Information Engineering(2009年国际信息工程会议)(ICIE 2009)
太原
英文
371-374
2009-07-10（万方平台首次上网日期，不代表论文的发表时间）