The classification and analysis of dynamic networks

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