Fast centrality-driven diffusion in dynamic networks

Diffusion processes in complex dynamic networks can arise, for instance, on data search, data routing, and information spreading. Therefore, understanding how to speed up the diffusion process is an important topic in the study of complex dynamic networks. In this paper, we shed light on how centrality measures and node dynamics coupled with simple diffusion models can help on accelerating the cover time in dynamic networks. Using data from systems with different characteristics, we show that if dynamics is disregarded, network cover time is highly underestimated. Moreover, using centrality accelerates the diffusion process over a different set of complex dynamic networks when compared with the random walk approach. For the best case, in order to cover 80% of nodes, fast centrality-driven diffusion reaches an improvement of 60%, i.e. when next-hop nodes are selected by using centrality measures. Additionally, we also propose and present the first results on how link prediction can help on speeding up the diffusion process in dynamic networks.

[1]  Alex Borges Vieira,et al.  SopCast P2P live streaming: live session traces and analysis , 2013, MMSys.

[2]  Jari Saramäki,et al.  Temporal Networks , 2011, Encyclopedia of Social Network Analysis and Mining.

[3]  Huadong Ma,et al.  Hug: Human gathering point based routing for opportunistic networks , 2012, 2012 IEEE Wireless Communications and Networking Conference (WCNC).

[4]  David D. Jensen,et al.  Navigating networks by using homophily and degree , 2008, Proceedings of the National Academy of Sciences.

[5]  Mostafa H. Ammar,et al.  PeopleRank: Social Opportunistic Forwarding , 2010, 2010 Proceedings IEEE INFOCOM.

[6]  Ram Ramanathan,et al.  Modeling and Analysis of Time-Varying Graphs , 2010, ArXiv.

[7]  Vassilis Kostakos.  Temporal Graphs , 2014, Encyclopedia of Social Network Analysis and Mining.

[8]  Ross J. Anderson,et al.  Temporal node centrality in complex networks. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Marcelo Dias de Amorim,et al.  VIP delegation: Enabling VIPs to offload data in wireless social mobile networks , 2011, 2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS).

[10]  Beom Jun Kim,et al.  Path finding strategies in scale-free networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Sergey N. Dorogovtsev,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .

[12]  Ljupco Kocarev,et al.  Network science: A new paradigm shift , 2010, IEEE Network.

[13]  Artur Ziviani,et al.  Distributed assessment of the closeness centrality ranking in complex networks , 2012, SIMPLEX '12.

[14]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Vito Latora,et al.  Entropy rate of diffusion processes on complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  N. Yoshida.  Estimation for diffusion processes from discrete observation , 1992 .

[17]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[18]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[19]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[20]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[21]  Cecilia Mascolo,et al.  Analysing information flows and key mediators through temporal centrality metrics , 2010, SNS '10.

[22]  Marián Boguñá,et al.  Navigability of Complex Networks , 2007, ArXiv.

[23]  Lada A. Adamic,et al.  How to search a social network , 2005, Soc. Networks.

[24]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[25]  Martin Everett,et al.  Ego network betweenness , 2005, Soc. Networks.

[26]  Chris Arney,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

[27]  Cynthia M. Lakon,et al.  How Correlated Are Network Centrality Measures? , 2008, Connections.

[28]  Kleber Vieira Cardoso,et al.  Dynamic labeling in wireless mesh networks , 2012, 2012 IEEE Latin-America Conference on Communications.

[29]  Jari Saramäki,et al.  Path lengths, correlations, and centrality in temporal networks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Albert-László Barabási,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .

[31]  Alessandro Vespignani,et al.  Complex dynamic networks: Tools and methods , 2012, Comput. Networks.

[32]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[33]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[34]  K. Sneppen,et al.  Searchability of networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.