Skip to main content

One Kind of Network Complexity Pyramid with Universality and Diversity

  • Conference paper
Complex Sciences (Complex 2009)

Abstract

It is based on well-known network models Euler graph, Erdös and Renyi random graph, Watts-Strogatz small-world model and Barabási-Albert scale-free networks, and combined the unified hybrid network theoretical frame. One kind of network complexity pyramid with universality and diversity is constructed, described and reviewed. It is found that most unweighted and weighted models of network science can be investigated in a unification form using four hybrid ratios (dr,fd,gr,vg). As a number of hybrid ratios increase, from the top level to the bottom level complexity and diversity of the pyramid is increasing but universality and simplicity is decreasing. The network complexity pyramid may have preferable understanding in complicated transition relationship between complexity-diversity and simplicity-universality.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Leonhard Euler(1707-1783), http://www2.zzu.edu.cn/math/

  2. Erdös, P., Rényi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Aci 5, 17–61 (1960)

    MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Watts, D.J.: The “New” Science of Networks. Annu. Rev. Sociol. 30, 243–270 (2004)

    Article  Google Scholar 

  6. Newman, M.E.J., Watts, D.J.: Renormalization group analysis of the small-world network model. Phys. Lett. A. 263, 341–346 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Networks: From Biological Mets to the Internet and WWW. Oxford University Press, Oxford (2003)

    Book  MATH  Google Scholar 

  8. Kleinberg, J.: Navigation in a small world. Nature 406, 845 (2000)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Strogatz, S.H.: Exploring complex networks. Nature (London) 410, 266–275 (2001)

    Article  Google Scholar 

  11. Mattick, J.S., Gagen, M.J.: Accelerating networks. Science 307, 856–858 (2005)

    Article  Google Scholar 

  12. Gagen, G.M., Mattick, J.S.: Accelerating, hyperaccelerating and decelerating probabilistic networks. Phys. Rev. E. 72, 016123 (2005)

    Article  Google Scholar 

  13. Sen, P.: Accelerated growth in outgoing links in evolving networks: Deterministic versus stochastic picture. Phys. Rev. E. 69, 046107 (2004)

    Article  Google Scholar 

  14. Laherrère, J., Sornette, D.: Stretched exponential distributions in nature and economy: “fat tails” with characteristic scales. Eur. Phys. J. B. 2, 525–539 (1998)

    Article  Google Scholar 

  15. Fang, J.Q., Liang, Y.: Topological properties and transition features generated by a new hybrid preferential model. Chin. Phys. Lett. 22, 2719–2722 (2005)

    Article  Google Scholar 

  16. Fang, J.Q., Bi, Q., Li, Y., et al.: A harmonious unifying preferential network model and its universal properties for complex dynamical network. Science in China Series G 50(3), 379–396 (2007)

    Article  Google Scholar 

  17. Fang, J.Q., Bi, Q., Li, Y., et al.: Sensitivity of exponents of three-power-laws to hybrid ratio in weighted HUHPM. Chi. Phys. Lett. 24(1), 279–282 (2007)

    Article  Google Scholar 

  18. Lu, X.B., Wang, X.F., Li, X., et al.: Topological transition features and synchronizability of a weighted hybrid preferential network. Physica A 370, 381–389 (2006)

    Article  Google Scholar 

  19. Fang, J.Q.: Exploring and advances in theoretical model of network science. Review of Science and Technology 24(12), 67–72 (2006)

    Google Scholar 

  20. Fang, J.Q., Wang, X.F., Zheng, Z.G., et al.: A New interdisciplinary Science— Network Science(I). Progress in Physics 27(3), 239–343 (2007)

    Google Scholar 

  21. Fang, J.Q., Wang, X.F., Zheng, Z.G., et al.: A New interdisciplinary Science— Network Science(II). Progress in Physics 27(4), 361–448 (2007)

    Google Scholar 

  22. Fang, J.Q., Bi, Q., Li, Y.: Advances in Theoretical models of network science. Front. Phys. China. 1, 109–124 (2007)

    Article  Google Scholar 

  23. Fang, J.Q., Li, Y., Bi, Q., et al.: From the harmonious unifying hybrid preferential attach-ment model toward a large unifying hybrid network model. J. Modern Phys. 21(30), 5121–5142 (2007)

    Article  Google Scholar 

  24. Li, Y., Fang, J.Q., Liu, Q.: New transition features of associatativity in large unified hybrid network. Review of Science and Technology 25(11), 23–29 (2007)

    Google Scholar 

  25. Fang, J.Q.: Evolution Features of Large Unifying Hybrid Network Model with a Variable Growing Speeds. In: The 4th International Workshop Hangzhou 2007 on Simulational Physics, invited talk, November 9-12, 2007, Hangzhou, Zhejiang (2007)

    Google Scholar 

  26. Fang, J.Q.: Some Progresses in Theoretical Model of Nonlinear Dynamical Complex Networks. In: Invited talk, 2008 National Physics Conference, September 18, Nanjing (2008)

    Google Scholar 

  27. Barrat, A., Barthélemy, M., Vespignani, V.: Weighted evolving networks: Coupling topology and weight dynamics. Phys. Rev. Lett. 92, 228701 (2004)

    Article  Google Scholar 

  28. Wang, W.X., Wang, B.H., Hu, B., et al.: General Dynamics of Topology and Traffic on Weighted Technological Networks. Phys. Rev. Lett. 94, 188702 (2005)

    Article  Google Scholar 

  29. Fang, J.Q.: Investigating High-Tech Networks with Four Levels From Developing Viewpoint of Network Science. World SCI – Tech R&D 30(5), 667–674 (2008) (in Chinese)

    Google Scholar 

  30. Wang, W.X., Wang, B.H., Hu, B., et al.: Mutual attraction model for both assortative and disassortative weighted networks. Phys. Rev. E. 73, 016133 (2006)

    Article  Google Scholar 

  31. Fang, J.Q., Li, Y.: Advances in unified hybrid theoretical model of network science. Advances in Mechanics 6, 663–678 (2008)

    Google Scholar 

  32. Fang, J.Q., Li, Y., BI, Q.: Unified Hybrid Variable Speed Growth Model and Transition of Topology Property. Complex Systems and Complexity Scinece 5(4), 56–65 (2008) (in Chinese)

    Google Scholar 

  33. Laherrére, J., Sornette, D.: Stretched exponential distributions in nature and economy: “fat tails” with characteristic scales. Eur. Phys. J.B. 2, 525–539 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Fang, JQ., Li, Y. (2009). One Kind of Network Complexity Pyramid with Universality and Diversity. In: Zhou, J. (eds) Complex Sciences. Complex 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02466-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02466-5_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02465-8

  • Online ISBN: 978-3-642-02466-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics