On the structure of changes in dynamic contact networks

8th International Conference on Signal Image Technology and Internet Based Systems, SITIS 2012r

Volumn , Issue , 2012, Pages 731-738

  Neiger, Vincent ^a   Crespelle, Christophe ^b   Fleury, Eric ^a  

^a UNIVERSITÉ DE LYON   (France)

^b UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL DYNAMICS; DYNAMIC CONTACTS; DYNAMIC NETWORK; NON-TRIVIAL; REAL-WORLD NETWORKS;

ROLLING RESISTANCE;

EID: 84874046072     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SITIS.2012.111     Document Type: Conference Paper

References (13)

1. D. Watts and S. Strogatz, "Collective dynamics of small-world networks," Nature, vol. 393, pp. 440-442, 1998.
2. D. Kempe, J. Kleinberg, and E. Tardos, "Maximizing the spread of influence through a social network," in ninth ACM international conference on knowledge discovery and data mining, ser. KDD '03. ACM, 2003, pp. 137-146.
3. R. Albert and A.-L. Barabási, "Statistical mechanics of complex networks," Reviews of Modern Physics, vol. 74, pp. 47-97, 2002.
4. R. Pastor-Satorras and A. Vespignani, "Epidemic spreading in scale-free networks," Physics Review Letters, vol. 86, pp. 3200-3203, 2001.
5. A. Scherrer, P. Borgnat, E. Fleury, J.-L. Guillaume, and C. Robardet, "Description and simulation of dynamic mobility networks," Computer Networks, vol. 52, no. 15, pp. 2842-2858, 2008.
6. A. E. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri, "Flooding time in edge-markovian dynamic graphs," in twenty-seventh ACM symposium on Principles of distributed computing, ser. PODC '08. ACM, 2008, pp. 213-222.
7. H. Baumann, P. Crescenzi, and P. Fraigniaud, "Parsimonious flooding in dynamic graphs," Distributed Computing, vol. 24, no. 1, pp. 31-44, 2011.
8. D. Archambault, H. Purchase, and B. Pinaud, "Difference Map Readability for Dynamic Graphs," in 18th International Symposium on Graph Drawing, ser. LNCS, vol. 6502, 2011, pp. 50-61.
9. M. Iliofotou, P. Pappu, M. Faloutsos, M. Mitzenmacher, S. Singh, and G. Varghese, "Network monitoring using traffic dispersion graphs (tdgs)," in 7th ACM SIGCOMM Internet Measurement Conference. ACM, 2007, pp. 315-320.
10. J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau, "CRAWDAD data set cambridge/haggle (v. 2009-05-29)," Downloaded from http://crawdad.cs.dartmouth.edu/cambridge/haggle, May 2009.
11. B. Bollobas, Random Graphs. Cambridge University Press, 2001.
12. C. Witt, "Greedy local search and vertex cover in sparse random graphs," in 6th Annual Conference on Theory and Applications of Models of Computation, ser. TAMC '09, 2009, pp. 410-419.
13. P.-U. Tournoux, J. Leguay, F. Benbadis, J. Whitbeck, V. Conan, and M. D. de Amorim, "Density-aware routing in highly dynamic dtns: The rollernet case," IEEE Trans. Mob. Comput., vol. 10, no. 12, pp. 1755-1768, 2011.