Skip to main content

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 117))

  • 1158 Accesses

Abstract

In this paper, we propose and investigate a evolving network model with both preferential and random attachment of new links, incorporating the additions of new nodes, new links, and the removals of links. Based on Markov chain theory, paper provides a rigorous proof for the existence of the steady-state degree distribution of the network generated by this model and gets its corresponding exact formulas and show that the model can generate scale-free evolving network.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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. Albert, R., Jeong, H., Barabási, A.-L.: The Diameter of the World-Wide Web. Nature 401, 130–131 (1999)

    Article  Google Scholar 

  2. Newman, M.E.J.: Scientific collaboration networks. I. Network construction and fundamental results. Phys. Rev. E 64, 0161311–0161318 (2001)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  4. Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of networks. Adv. Phys. 51, 1079–1187 (2002)

    Article  Google Scholar 

  5. Bollobás, B., Riordan, O.: Mathematical results on scale-free random graphs. In: Handbook of Graphs and Networks, pp. 99–121. Wiley-VCH, Berlin (2002)

    Google Scholar 

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

    Article  Google Scholar 

  7. Wagner, A.: The Yeast Protein Interaction Network Evolves Rapidly and Contains Few Redundant Duplicate Genes. Mol. Biol. Evol. 18, 1283–1292 (2001)

    Article  Google Scholar 

  8. Wasserman, S., Faust, K.: Social network analysis: Methods and applications. Cambridge University Press, Cambridge (1994)

    Google Scholar 

  9. Garcia-Domingo, J.L., Juher, D., Saldanňa: Degree correlations in growing networks with deletion of nodes. Physica D 237, 640–651 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  11. Shi, D., Chen, Q.H., Liu, L.M.: Degree distributions of evolving networks. Europhys. Lett. 76, 731–737 (2006)

    Article  Google Scholar 

  12. Liu, Z., Lai, Y.-C., et al.: Connectivity distribution and attack tolerance of general networks with both preferential and random attachments. Physics Letters A 303, 337–344 (2002)

    Article  MATH  Google Scholar 

  13. Zhao, Q., et al.: The degree distribution of fixed act-size collaboration networks. Pramana-Journal of Physics 73, 955–959 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lei Min .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Min, L., Qinggui, Z. (2012). Degree Distribution of a Mixed Attachments Model for Evolving Networks. In: Wu, Y. (eds) Advanced Technology in Teaching - Proceedings of the 2009 3rd International Conference on Teaching and Computational Science (WTCS 2009). Advances in Intelligent and Soft Computing, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25437-6_110

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25437-6_110

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics