In this paper, we abstract a kind of stochastic processes from evolving processes of growing networks, this process is called growing network Markov chains. Thus the existence and the formulas of degree distribution are transformed to the corresponding problems of growing network Markov chains. First we investigate the growing network Markov chains, and obtain the condition in which the steady degree distribution exists and get its exact formulas. Then we apply it to various growing networks. With this method, we get a rigorous, exact and unified solution of the steady degree distribution for growing networks. © 2009 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.
CITATION STYLE
Hou, Z., Kong, X., Shi, D., Chen, G., & Zhao, Q. (2009). Degree-distribution stability of growing networks. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (Vol. 5 LNICST, pp. 1827–1837). https://doi.org/10.1007/978-3-642-02469-6_59
Mendeley helps you to discover research relevant for your work.