Skip to main content
Log in

Scale-free network models with accelerating growth

  • Research Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

Complex networks are everywhere. A typical example is software network. Basing on analyzing evolutive structure of the software networks, we consider accelerating growth of network as power-law growth, which can be more easily generalized to real systems than linear growth. For accelerating growth via a power law and scale-free state with preferential linking, we focus on exploring the generic property of complex networks. Generally, two scenarios are possible. In one of them, the links are undirected. In the other scenario, the links are directed. We propose two models that can predict the emergence of power-law growth and scale-free state in good agreement with these two scenarios and can simulate much more real systems than existing scale-free network models. Moreover, we use the obtained predictions to fit accelerating growth and the connectivity distribution of software networks describing scale-free structure. The combined analytical and numerical results indicate the emergence of a novel set of models that considerably enhance our ability to understand and characterize complex networks, whose applicability reaches far beyond the quoted examples.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Myers C R. Software systems as complex networks: structure, function, and evolvability of software collaboration graphs. Physical Review E, 2003, 68(4): 046116

    Article  Google Scholar 

  2. Li H, Huang B, Lü J. Dynamical evolution analysis of the objectoriented software systems. In: Proceedings of the 2008 IEEE Congress on Evolutionary Computation (IEEE CEC 2008). Hong Kong, 2008, 3030–3035

  3. Faloutsos M, Faloutsos P, Faloutsos C. On power-law relationships of the internet topology. ACM SIGCOMM Computer Communications Review, 1999, 29(4): 251–262

    Article  Google Scholar 

  4. Lawrence S, Giles C L. Accessibility of information on the web. Nature, 1999, 400(6740): 107–109

    Article  Google Scholar 

  5. Wasserman S, Faust K. Social Network Analysis. Cambridge, UK: Cambridge University Press, 1994

    Google Scholar 

  6. Fell D A, Wagner A. The small world of metabolism. Nature Biotechnology, 2000, 18(11): 1121–1122

    Article  Google Scholar 

  7. Zhang Z Z, Zhou S G, Zou T, et al. Incompatibility networks as models of scale-free small-world graphs. European Physical Journal B, 2007, 60(2): 259–264

    Article  Google Scholar 

  8. Erdosö P, Rényi A. On the evolution of random graphs. Pupl. Math. Inst. Hungar. Acad. Sci., 1960, 7: 17–61

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  11. Lü J, Chen G. A time-varying complex dynamical network model and its controlled synchronization criteria. IEEE Transactions on Automatic Control, 2005, 50(6): 841–846

    Article  Google Scholar 

  12. Zhou J, Lu J, Lü J. Pinning adaptive synchronization of a general complex dynamical network. Automatica, 2008, 44(4): 996–1003

    Google Scholar 

  13. Zhou J, Lu J, Lü J. Adaptive synchronization of an uncertain complex dynamical network. IEEE Transactions on Automatic Control, 2006, 51(4): 652–656

    Article  Google Scholar 

  14. Lü J, Yu X, Chen G, Cheng D. Characterizing the synchronizability of small-world dynamical networks. IEEE Transactions on Circuits and Systems I, 2004, 51(4): 787–796

    Article  MathSciNet  Google Scholar 

  15. Albert R, Barabási A L. Statistical mechanics of complex networks. Reviews of Modern Physics, 2002, 74(1): 47–97

    Article  MathSciNet  Google Scholar 

  16. Newman M. The structure and function of complex networks. SIAM Review, 2003, 45(2): 167–256

    Article  MATH  MathSciNet  Google Scholar 

  17. Amaral L A N, Scala A, Barthélémy M, Stanley H E. Classes of small-world networks. Proceedings of the National Academy of Sciences of the United States of America, 2000, 97(21): 11149–11152

    Article  Google Scholar 

  18. Dorogovtsev S N, Mendes J F. Effect of the accelerating growth of communications networks on their structure. Physical Review E, 2001, 63(2): 025101

    Article  Google Scholar 

  19. Shi D, Chen Q, Liu L. Markov chain-based numerical method for degree distributions of growing networks. Physical Review E, 2005, 71(3): 036140

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Huan Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, H. Scale-free network models with accelerating growth. Front. Comput. Sci. China 3, 373–380 (2009). https://doi.org/10.1007/s11704-009-0041-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-009-0041-3

Keywords

Navigation