Abstract
In this paper, we propose a difference equation approach to the estimation of the degree distributions in growing networks after having analyzed the disadvantages of some existing approaches. This approach can avoid logic conflicts caused by the continuum of discrete problems, and does not need the existence assumption of the stationary degree distribution in the network analysis. Using this approach, we obtain a degree distribution formula of the Poisson growth and preferential attachment network. It is rigorously shown that this network is scale-free based on the Poisson process theory and properties of Γ-distribution.
Similar content being viewed by others
References
Erdös, P. and Rényi, A. On random graphs. Publ. Math. Debrecen 6, 290–297 (1959)
Price, D. J. D. Networks of scientific papers. Science 149(3683), 510–515 (1965)
Price, D. J. D. A general theory of bibliometric and other cumulative advantage processes. J. Amer. Soc. Inform. Sci. 27, 292–306 (1976)
Watts, D. J. and Strogatz, S. H. Collective dynamics of “small-world” networks. Nature 393(6684), 440–442 (1998)
Barabási, A. L. and Albert, R. Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
Barabási, A. L., Albert, R., and Jeong, H. Mean-field theory for scale-free random networks. Physica A 272(1–2), 173–187 (1999)
Albert, R. and Barabási, A. L. Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47–97 (2002)
Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., and Hwang, D. U. Complex networks: structure and dynamics. Phys. Rep. 424(4–5), 175–308 (2006)
Krapivsky, P. L. and Redner, S. Organization of growing random networks. Phys. Rev. E 63(6), 066123 (2001)
Dorogovtsev, S. N. and Mendes, J. F. F. Evolution of Networks: From Biological Nets to the Internet and WWW, Oxford University Press, Oxford, UK (2003)
Toivonen, R., Onnela, J. P., Saramäki, J., Hyvönen, J., and Kaski, K. A model for social networks. Physica A 371(2), 851–860 (2006)
Wang, L. N., Guo, J. L., Yang, H. X., and Zhou, T. Local preferential attachment model for hierarchical networks. Physica A 388(8), 1713–1720 (2009)
Guo, J. L. and Bai, Y. Q. A note on mean-field theory for scale-free random networks. Dyn. Conti. Disc. Impul. Syst. B 13(3), 523–531 (2006)
Hase, M. O. and Mendes, J. F. F. Solvable metric growing networks. J. Stat. Mech., P12002 (2008)
Guo, J. L. The classification and analysis of dynamic networks. Chin. Phys. 16(5), 1239–1245 (2007)
Lü, J. H., Chen, G., and Cheng, D. A time-varying complex dynamical network model and its controlled synchronization criteria. IEEE Trans. Autom. Control. 50(6), 841–846 (2005)
Chen, L., Lü, J. H., Lu, J. L., and Hill, D. J. Local asymptotic coherence of time-varying discrete ecological networks. Automatica 45(2), 546–552 (2009)
Yu, W. W., Chen, G. R., and Lü, J. H. On pinning synchronization of complex dynamical networks. Automatica 45(2), 429–435 (2009)
Guo, J. L. A new approach research dynamic complex networks(in Chinese). Systems Engineering-Theory & Practice 26(7), 33–40 (2006)
Guo, J. L. and Wang, C. P. Poisson continuous time growing complex networks. Dyn. Conti. Disc. Impul. Syst. A 13, 970–972 (2006)
Ross, S. M. Stochastic Processes, John Wiley & Sons, Inc., New York (1983)
Bollobás, B. and Riordan, O. M. Mathematical results on scale-free random graphs. Handbook of Graphs and Network, Wiley-VCH, Berlin, 1–34 (2003)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Li-qun CHEN
Project supported by the National Natural Science Foundation of China (No. 70871082) and the Foundation of Shanghai Leading Academic Discipline Project (No. S30504)
Rights and permissions
About this article
Cite this article
Guo, Jl. A difference equation approach to statistical mechanics of complex networks. Appl. Math. Mech.-Engl. Ed. 30, 1063–1068 (2009). https://doi.org/10.1007/s10483-009-0813-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10483-009-0813-6