Skip to main content
Log in

A difference equation approach to statistical mechanics of complex networks

  • Published:
Applied Mathematics and Mechanics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Erdös, P. and Rényi, A. On random graphs. Publ. Math. Debrecen 6, 290–297 (1959)

    MATH  MathSciNet  Google Scholar 

  2. Price, D. J. D. Networks of scientific papers. Science 149(3683), 510–515 (1965)

    Article  Google Scholar 

  3. Price, D. J. D. A general theory of bibliometric and other cumulative advantage processes. J. Amer. Soc. Inform. Sci. 27, 292–306 (1976)

    Article  Google Scholar 

  4. Watts, D. J. and Strogatz, S. H. Collective dynamics of “small-world” networks. Nature 393(6684), 440–442 (1998)

    Article  Google Scholar 

  5. Barabási, A. L. and Albert, R. Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  6. 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)

    Article  Google Scholar 

  7. Albert, R. and Barabási, A. L. Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47–97 (2002)

    Article  Google Scholar 

  8. 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)

    Article  MathSciNet  Google Scholar 

  9. Krapivsky, P. L. and Redner, S. Organization of growing random networks. Phys. Rev. E 63(6), 066123 (2001)

    Google Scholar 

  10. 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)

    MATH  Google Scholar 

  11. 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)

    Article  Google Scholar 

  12. 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)

    Article  Google Scholar 

  13. 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)

    MATH  MathSciNet  Google Scholar 

  14. Hase, M. O. and Mendes, J. F. F. Solvable metric growing networks. J. Stat. Mech., P12002 (2008)

  15. Guo, J. L. The classification and analysis of dynamic networks. Chin. Phys. 16(5), 1239–1245 (2007)

    Article  Google Scholar 

  16. 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)

    Article  Google Scholar 

  17. 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)

    Article  MATH  Google Scholar 

  18. Yu, W. W., Chen, G. R., and Lü, J. H. On pinning synchronization of complex dynamical networks. Automatica 45(2), 429–435 (2009)

    Article  MATH  Google Scholar 

  19. Guo, J. L. A new approach research dynamic complex networks(in Chinese). Systems Engineering-Theory & Practice 26(7), 33–40 (2006)

    Google Scholar 

  20. Guo, J. L. and Wang, C. P. Poisson continuous time growing complex networks. Dyn. Conti. Disc. Impul. Syst. A 13, 970–972 (2006)

    Google Scholar 

  21. Ross, S. M. Stochastic Processes, John Wiley & Sons, Inc., New York (1983)

    MATH  Google Scholar 

  22. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jin-li Guo  (郭进利).

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

Reprints 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

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10483-009-0813-6

Key words

Chinese Library Classification

2000 Mathematics Subject Classification

Navigation