Skip to main content

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

  • 2201 Accesses

Abstract

It presents a dynamic model of network formation where nodes with that form links in two ways: some are connected randomness, and others are connected based on current structure of the network. In the formation model the deleting links are also considered. The degree distribution and degree exponent are obtained by mean-field approach theory. The parameters which represent the process of randomness, and the degree distribution are set up. The different network formation is discussed based on the change of parameters.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Erdǒs, P., Rényi, A.: On the evolution of random graphs. Pub. Math. Ins. Hun. Aca. Sci. 5, 17–61 (1960)

    Google Scholar 

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

    Article  Google Scholar 

  3. Barabási, A.L., Albert, R., Jeong, H.: Mean-field theory for scale-free random networks. Phy. A 272, 173–187 (1999)

    Article  Google Scholar 

  4. 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 

  5. Krapivsky, P.L., Redner, S., Leyvraz, F.: Connectivity of growing random networks. Phys. Rev. Lett. 85, 4629–4632 (2000)

    Article  Google Scholar 

  6. Liu, Z.H., Lai, Y.C., Ye, N., Dasgupta, P.: Connective distribution and attack tolerance of general networks with both preferential and random attachments. Phys. Lett. A 303, 337–344 (2002)

    Article  MATH  Google Scholar 

  7. Shi, D.H., Chen, Q.H., Liu, L.M.: Markov chain-based numerical method for degree distribution of growing networks. Phys. Rev. E71, 036140 (2005)

    Google Scholar 

  8. Watts, D.J., Strogaze, S.H.: Collective dynamics of small-world networks. Nature 393, 440–442 (1998)

    Article  Google Scholar 

  9. Bollobas, B.: Mathematical results on scale-free random graphs. In: Bornholdt, S., Schuster, H.G.: Wiley-VCH, pp. 1–34 (2002)

    Google Scholar 

  10. Newman, M.E.J., Strogaz, S.H., Watta, D.J.: Random graphs with arbitrary degree distribution and their application. Phy. Rev. E 64, 026118 (2003)

    Article  Google Scholar 

  11. Shi, D.H., Zhu, X., Liu, L.M.: Clustering coefficient of growing networks. Physica A 381, 515–524 (2007)

    Article  Google Scholar 

  12. Jackson, M.O.: Social and economic networks, pp. 124–150. Princeton university press, New York (2008)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yanjun Fang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag GmbH Berlin Heidelberg

About this chapter

Cite this chapter

Fang, Y. (2012). The Influence of Randomness on Network Formation. In: Jin, D., Lin, S. (eds) Advances in Electronic Commerce, Web Application and Communication. Advances in Intelligent and Soft Computing, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28655-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28655-1_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28654-4

  • Online ISBN: 978-3-642-28655-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics