The classification and analysis of dynamic networks

In this paper we, firstly, classify the complex networks in which the nodes are of the lifetime distribution. Secondly, in order to study complex networks in terms of queuing system and homogeneous Markov chain, we establish the relation between the complex networks and queuing system, providing a new way of studying complex networks. Thirdly, we prove that there exist stationary degree distributions of M–G–P network, and obtain the analytic expression of the distribution by means of Markov chain theory. We also obtain the average path length and clustering coefficient of the network. The results show that M–G–P network is not only scale-free but also of a small-world feature in proper conditions.