Skip to main content

A More Strict Definition of Steady State Degree Distribution

  • Conference paper
Complex Sciences (Complex 2009)

Abstract

Accurate definitions of related concepts are prerequisite for further understanding of evolving network. To be an important concept, steady state degree distribution has been widely used. However, as we find out, all current definitions have a common default from mathematics point of view. In this paper, we first point out the shortcoming of current definitions through a special type of evolving network, and then provide a more strict definition of steady state degree distribution from stochastic process point of view.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Barabási, A.L., Albert, R., Jeong, H.: Mean-field Theory of Scale-free Random Networks. Phys. A 272, 173–187 (1999)

    Article  Google Scholar 

  2. Dorogovtsev, S.N., Mendes, J.F.F.: Effect of the Accelerating Growth of Communication Networks on Their Structure. Phys. Rev. E 63, 025101 (2001)

    Article  Google Scholar 

  3. Shi, D.H., Chen, Q.H., Liu, L.M.: Markov Chain-based Numerical Method for Degree Distributions of Growing Networks. Phys. Rev. E 71, 036140 (2005)

    Article  Google Scholar 

  4. Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Networks. Advances in Phys. 519, 107–174 (2002)

    Google Scholar 

  5. Albert, R., Barabási, A.L.: Topology of Evolving Networks: Local Events and Universality. Phys. Rev. Lett. 85(24), 5234–5237 (2000)

    Article  Google Scholar 

  6. Jennifer, L.S., Hughes, B.D., Landman, K.A.: Evolving Mortal Networks. Phys. Rev. E 73, 066111 (2006)

    Article  Google Scholar 

  7. Li, X., Chen, G.R.: A Local World Evolving Network Model. Phys. A 328, 274–286 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Krapivsky, P.L., Redner, S., Leyvraz, F.: Connectivity of Growing Random Networks. Phys. Rev. Lett. 85, 4629–4632 (2000)

    Article  Google Scholar 

  9. Dorogovtsev, S.N., Mendes, J.F.F., Samukhin, A.N.: Structure of Growth Networks with Preferential Linking. Phys. Rev. Lett. 85, 4633–4636 (2000)

    Article  Google Scholar 

  10. Guo, J.L.: A New Approach Research Dynamic Complex Networks. Sys. Engi. - Theory & Practice 7, 33–40 (2006)

    Google Scholar 

  11. Chan, D.Y.C., Hughes, B.D., Leong, A.S.: Stochastically Evolving Networks. Phys. Rev. E 68, 066124 (2003)

    Article  MathSciNet  Google Scholar 

  12. Volz, E.: Random Networks with Tunable Degree Distribution and Clustering. Phys. Rev. E 70, 056115 (2004)

    Article  Google Scholar 

  13. Mohanty, P.K., Jalan, S.: Analytical results for stochastically growing networks: Connection to the zero-range process. Phys. Rev. E 77, 045102(R) (2008)

    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

Zhang, X., He, Z. (2009). A More Strict Definition of Steady State Degree Distribution. In: Zhou, J. (eds) Complex Sciences. Complex 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02469-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02469-6_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02468-9

  • Online ISBN: 978-3-642-02469-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics