SciELO - Scientific Electronic Library Online

 
vol.60 número2Resonance frequency as a function of the time needed by epoxic glue to fix a probeCalculation of the influence of the absorption grating on the diffraction efficiency in photovoltaic media in reflection geometry for nonlinear regimes índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Journal

Artigo

Indicadores

Links relacionados

  • Não possue artigos similaresSimilares em SciELO

Compartilhar


Revista mexicana de física

versão impressa ISSN 0035-001X

Rev. mex. fis. vol.60 no.2 México Mar./Abr. 2014

 

Investigación

 

The impact of time delay in the connectivity distribution of complex networks generated using the Barabási-Albert model

 

J. Acosta-Elíasa, P. D. Arjona-Villicañaa, and L. Moldes-Navarrob

 

a Universidad Autónoma de San Luis Potosí, Salvador Nava s/n, Zona Universitaria, CP 78290, San Luis Potosí, SLP, México, e-mail: jacosta@uaslp.mx

b Universitat Politècnica de Catalunya, Campus Nord UPC, Jordi Girona 1-3, 08034 Barcelona Spain.

 

Received 7 February 2012.
Accepted 22 January 2014.

 

Abstract

In the Barabási-Albert growth model for complex networks new nodes added to the network, obtain instant information from the entire network and employ preferential connectivity to select a node to establish a connection. In practice, information takes time to propagate from a sender to a receiver. We modify the Barabási-Albert model to include the time information takes to propagate between nodes. In the modified model a time delay is associated to the transmission of information and each new node must wait for a period of time to receive the network connectivity information. By adjusting this waiting time, different functional forms of the connectivity distribution are obtained. These connectivity distributions form a spectrum of functional forms which lie between two limiting cases: a power law distribution for large waiting times and an exponential distribution for short waiting times.

Keywords: Complex networks.

 

PACS: 89.75.-k; 64.60.aq

 

DESCARGAR ARTÍCULO EN FORMATO PDF

 

Acknowledgments

The authors would like to thank the Universidad Autónoma de San Luis Potosí, the Universidad Politécnica de Catalunya and Mexico's CONACYT for its support.

 

References

1. M. E. J. Newman, Am. J. Phys. 79 (2011) 800.         [ Links ]

2. A.-L. Barabási, Science 325 (2009) 412.         [ Links ]

3. Reká Albert and Albert-Lazlo Barabási, Rev. Mod. Phys. 74 (2002) 47.         [ Links ]

4. S.N. Dorogovtsev and A. V. Goltsev, Rev. Mod. Phys 80 (2008) 1275.         [ Links ]

5. H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai, and A.-L. Barabási, Nature 407 (2000) 651.         [ Links ]

6. Barabási, R. Albert, H. Jeong, and G. Bianconi, Science 287 (2000) 2115.         [ Links ]

7. A.L. Barabási, H. Jeong, Z. Neda, E. Ravasz, A. Schubert, and T. Vicsek, Physica A 311 (2002) 590.         [ Links ]

8. M. Faloutsos, P. Faloutsos, and C. Faloutsos, in proceeding of ACM SIGCOMM(Boston Sep 1999) 251.         [ Links ]

9. B. A. Huberman and L. A. Adamic, Nature 410 (1999) 131.         [ Links ]

10. V. M. Eguiluz, D. R. Chialvo, G. A. Cecchi, M. Baliki, and A. V. Apkarian, Phys. Rev. Lett. 94 (2005) 018102.         [ Links ]

11. A.-L. Barabási and R. Albert, Science 286 (1999) 509.         [ Links ]

12. P. L. Krapivsky, S. Redner, and F. Leyvraz, Phys. Rev. Lett. 85 (2000) 4629.         [ Links ]

13. Reká Albert and A.-L. Barabási, Phys. Rev. Lett. 85 (2000) 5234.         [ Links ]

14. S. N. Dorogovtsev and J. F. F. Mendes, Phys. Rev. E 63 (2001) 025101.         [ Links ]

15. S. N. Dorogovtsev and J. F. F. Mendes, Phys. Rev. E 62 (2000) 1842.         [ Links ]

16. Teerawat Issariyakul and Ekram Hossain, Introduction to Network Simulator NS?(Springuer, New York, 2009) Vol. 1.         [ Links ]

17. S.N. Dorogovtsev and J. F. F. Mendes, Evolution of Networks: From Biological Nets to the Internet and WWW (Oxford University Press, Oxford, 16 January 2003.) pp. 112-114.         [ Links ]

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons