Small-world behavior in time-varying graphs

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 81, Issue 5, 2010, Pages

  Tang, J ^a   Scellato, S ^a   Musolesi, M ^a   Mascolo, C ^a   Latora, V ^b,c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF CATANIA   (Italy)

^c SCUOLA SUPERIORE DI CATANIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; SMALL WORLDS; SYNTHETIC-TIME; TEMPORAL DISTANCE; TIME VARYING;

MOBILE AGENTS; TIME VARYING NETWORKS; TIME VARYING SYSTEMS;

REAL TIME SYSTEMS;

EID: 77953098690     PISSN: 15393755     EISSN: 15502376     Source Type: Journal    
DOI: 10.1103/PhysRevE.81.055101     Document Type: Article

References (29)

1. R. Albert and A.-L. Barabási, Rev. Mod. Phys. 74, 47 (2002) 10.1103/RevModPhys.74.47
2. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of networks (Oxford University Press, Oxford, 2003) 10.1093/acprof:oso/9780198515906.001.0001
3. S. Boccaletti, Phys. Rep. 424, 175 (2006). 10.1016/j.physrep.2005.10.009
4. M. C. González, Nature (London) 453, 779 (2008). 10.1038/nature06958
5. A. Buscarino, EPL 82, 38002 (2008). 10.1209/0295-5075/82/38002
6. P. Holme, Phys. Rev. E 71, 046119 (2005). 10.1103/PhysRevE.71.046119
7. G. Kossinets, Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'08), August 24-27, 2008, Las Vegas, Nevada, USA (unpublished).
8. B. Tadić and S. Thurner, Physica A 332, 566 (2004). 10.1016/j.physa.2003.10.007
9. B. Tadić, Physica A 293, 273 (2001). 10.1016/S0378-4371(01)00014-0
10. C. Caretta-Cartozo, PLOS Comput. Biol. 3, e103 (2007). 10.1371/journal.pcbi.0030103
11. A. Ahmed and E. P. Xing, Proc. Natl. Acad. Sci. U.S.A. 106, 11878 (2009). 10.1073/pnas.0901910106
12. M. Valencia, Phys. Rev. E 77, 050905 (R) (2008). 10.1103/PhysRevE.77. 050905
13. F. De Vico Fallani, J. Phys. A: Math. Theor. 41, 224014 (2008). 10.1088/1751-8113/41/22/224014
14. S. N. Dorogovtsev and J. F. F. Mendes, Phys. Rev. E 63, 056125 (2001). 10.1103/PhysRevE.63.056125
15. A. Gautreau, Proc. Natl. Acad. Sci. U.S.A. 106, 8847 (2009). 10.1073/pnas.0811113106
16. A. Raval, Phys. Rev. E 68, 066119 (2003). 10.1103/PhysRevE.68.066119
17. J. Stehle, Phys. Rev. E 81, 035101 (R) (2010). 10.1103/PhysRevE.81.035101
18. D. J. Watts and S. H. Strogatz, Nature (London) 393, 440 (1998). 10.1038/30918
19. V. Latora and M. Marchiori, Phys. Rev. Lett. 87, 198701 (2001). 10.1103/PhysRevLett.87.198701
20. C. Caretta Cartozo and P. De Los Rios, Phys. Rev. Lett. 102, 238703 (2009). 10.1103/PhysRevLett.102.238703
21. A.-L. Barabási, Physica A 311, 590 (2002). 10.1016/S0378-4371(02) 00736-7
22. A. Clauset and N. Eagle, in Proceedings of DIMACS Workshop on Computational Methods for Dynamic Interaction Network, 2007 (unpublished).
23. D. Kempe, J. Comput. Syst. Sci. 64, 820 (2002). 10.1006/jcss.2002.1829
24. V. Kostakos, Physica A 388, 1007 (2009). 10.1016/j.physa.2008.11.021
25. J. Park and M. E. J. Newman, Phys. Rev. E 70, 066117 (2004). 10.1103/PhysRevE.70.066117
26. G. Bianconi, Phys. Rev. E 79, 036114 (2009). 10.1103/PhysRevE.79.036114
27. C. Wilson, Procs. of EuroSys 09, 205 (2009).
28. J. Scott, CRAWDAD Trace (INFOCOM, Barcelona, 2006).
29. In our discussion, we have implicitly assumed that the typical time, τ m, to pass a message from a node to one of its first neighbors is of the same order as the typical time, τ g, at which the graphs in the sequence are changing. We can simulate the case τ m < τ g by increasing the reach of a message (within a graph in the sequence) past its first neighbors. Note however that as the reach increases, the values of L will decrease while C does not change; therefore our main results still hold.