A unifying model for representing time-varying graphs

Graph-based models form a fundamental aspect of data representation in Data Sciences and play a key role in modeling complex networked systems. In particular, recently there is an ever-increasing interest in modeling dynamic complex networks, i.e. networks in which the topological structure (nodes and edges) may vary over time. In this context, we propose a novel model for representing finite discrete Time-Varying Graphs (TVGs), which are typically used to model dynamic complex networked systems. We analyze the data structures built from our proposed model and demonstrate that, for most practical cases, the asymptotic memory complexity of our model is in the order of the cardinality of the set of edges. Further, we show that our proposal is an unifying model that can represent several previous (classes of) models for dynamic networks found in the recent literature, which in general are unable to represent each other. In contrast to previous models, our proposal is also able to intrinsically model cyclic (i.e. periodic) behavior in dynamic networks. These representation capabilities attest the expressive power of our proposed unifying model for TVGs. We thus believe our unifying model for TVGs is a step forward in the theoretical foundations for data analysis of complex networked systems.

[1]  Eric Fleury,et al.  Dynamic Contact Network Analysis in Hospital Wards , 2014, CompleNet.

[2]  Eric Fleury,et al.  MultiAspect Graphs: Algebraic representation and algorithms , 2015, Algorithms.

[3]  Alessandro Vespignani,et al.  EPIDEMIC SPREADING IN SCALEFREE NETWORKS , 2001 .

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

[5]  Donald F. Towsley,et al.  Characterizing continuous time random walks on time varying graphs , 2012, SIGMETRICS '12.

[6]  T. Kolda Multilinear operators for higher-order decompositions , 2006 .

[7]  Richard Barrett,et al.  Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.

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

[9]  Xingming Zhao,et al.  Computational Systems Biology , 2013, TheScientificWorldJournal.

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

[11]  Alex Borges Vieira,et al.  Fast centrality-driven diffusion in dynamic networks , 2013, WWW.

[12]  Petter Holme,et al.  Modern temporal network theory: a colloquium , 2015, The European Physical Journal B.

[13]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks , 2008 .

[14]  P. Holme Network reachability of real-world contact sequences. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Ioannis Chatzigiannakis,et al.  Efficient data propagation strategies in wireless sensor networks using a single mobile sink , 2008, Comput. Commun..

[16]  Mason A. Porter,et al.  Multilayer networks , 2013, J. Complex Networks.

[17]  Ulrik Brandes,et al.  What is network science? , 2013, Network Science.

[18]  Afonso Ferreira,et al.  Evolving graphs and least cost journeys in dynamic networks , 2003 .

[19]  NainPhilippe,et al.  Characterizing continuous time random walks on time varying graphs , 2012 .

[20]  Chris Mattmann,et al.  Computing: A vision for data science , 2013, Nature.

[21]  Alex Borges Vieira,et al.  Time Centrality in Dynamic Complex Networks , 2015, Adv. Complex Syst..

[22]  Dan Braha,et al.  From Centrality to Temporary Fame: Dynamic Centrality in Complex Networks , 2006, Complex..

[23]  Roy Friedman,et al.  DEEP: Density-based proactive data dissemination protocol for wireless sensor networks with uncontrolled sink mobility , 2010, Comput. Commun..

[24]  Sujeet Akula,et al.  Dynamics of and on Complex Networks , 2011 .

[25]  Eric Fleury,et al.  On MultiAspect graphs , 2014, Theor. Comput. Sci..

[26]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[27]  Afonso Ferreira,et al.  Building a reference combinatorial model for MANETs , 2004, IEEE Network.

[28]  Michalis Faloutsos,et al.  Exploiting dynamicity in graph-based traffic analysis: techniques and applications , 2009, CoNEXT '09.

[29]  A. Vespignani Predicting the Behavior of Techno-Social Systems , 2009, Science.

[30]  Jignesh M. Patel,et al.  Big data and its technical challenges , 2014, CACM.

[31]  Cigdem Sengul,et al.  A survey of adaptive services to cope with dynamics in wireless self-organizing networks , 2012, CSUR.

[32]  Cecilia Mascolo,et al.  Temporal distance metrics for social network analysis , 2009, WOSN '09.

[33]  Ted G. Lewis,et al.  Network Science: Theory and Applications , 2009 .

[34]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

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

[36]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[37]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[38]  S. Hill,et al.  Dynamic model of time-dependent complex networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[39]  Qinna Wang,et al.  Link prediction and threads in email networks , 2014, 2014 International Conference on Data Science and Advanced Analytics (DSAA).

[40]  V Latora,et al.  Small-world behavior in time-varying graphs. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[41]  Vasant Dhar,et al.  Data science and prediction , 2012, CACM.

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

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