Approximating the Temporal Neighbourhood Function of Large Temporal Graphs

Temporal networks are graphs in which edges have temporal labels, specifying their starting times and their traversal times. Several notions of distances between two nodes in a temporal network can be analyzed, by referring, for example, to the earliest arrival time or to the latest starting time of a temporal path connecting the two nodes. In this paper, we mostly refer to the notion of temporal reachability by using the earliest arrival time. In particular, we first show how the sketch approach, which has already been used in the case of classical graphs, can be applied to the case of temporal networks in order to approximately compute the sizes of the temporal cones of a temporal network. By making use of this approach, we subsequently show how we can approximate the temporal neighborhood function (that is, the number of pairs of nodes reachable from one another in a given time interval) of large temporal networks in a few seconds. Finally, we apply our algorithm in order to analyze and compare the behavior of 25 public transportation temporal networks. Our results can be easily adapted to the case in which we want to refer to the notion of distance based on the latest starting time.

[1]  Jon M. Kleinberg,et al.  The structure of information pathways in a social communication network , 2008, KDD.

[2]  David Eppstein,et al.  Fast approximation of centrality , 2000, SODA '01.

[3]  Edith Cohen,et al.  All-Distances Sketches , 2016, Encyclopedia of Algorithms.

[4]  Roberto Grossi,et al.  Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound , 2010, ESA.

[5]  Marco Rosa,et al.  HyperANF: approximating the neighbourhood function of very large graphs on a budget , 2010, WWW.

[6]  Kathleen M. Carley,et al.  Patterns and dynamics of users' behavior and interaction: Network analysis of an online community , 2009, J. Assoc. Inf. Sci. Technol..

[7]  Elise Miller-Hooks,et al.  Measuring and maximizing resilience of freight transportation networks , 2012, Comput. Oper. Res..

[8]  Yu Nie,et al.  Finding optimal hyperpaths in large transit networks with realistic headway distributions , 2015, Eur. J. Oper. Res..

[9]  Stefan Nickel,et al.  Hub location problems in transportation networks , 2011 .

[10]  Andrew V. Goldberg,et al.  Route Planning in Transportation Networks , 2015, Algorithm Engineering.

[11]  Christos Faloutsos,et al.  ANF: a fast and scalable tool for data mining in massive graphs , 2002, KDD.

[12]  Yi Lu,et al.  Path Problems in Temporal Graphs , 2014, Proc. VLDB Endow..

[13]  Pierre BORGNAT,et al.  Evolving Networks , 2018, Encyclopedia of Social Network Analysis and Mining. 2nd Ed..

[14]  Daniel Massey,et al.  Collecting the internet AS-level topology , 2005, CCRV.

[15]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[16]  Andrea Marino,et al.  Degrees of Separation and Diameter in Large Graphs , 2019, Encyclopedia of Big Data Technologies.

[17]  Afonso Ferreira,et al.  Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks , 2003, ADHOC-NOW.

[18]  Edith Cohen,et al.  Tighter estimation using bottom k sketches , 2008, Proc. VLDB Endow..

[19]  Jérôme Kunegis,et al.  KONECT: the Koblenz network collection , 2013, WWW.

[20]  Clémence Magnien,et al.  Time evolution of the importance of nodes in dynamic networks , 2015, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[21]  許鉅秉,et al.  國際期刊 Transportation Research-Part E---Logistics and Transportation Review 特刊編輯補助 , 2006 .

[22]  Jinfeng Li,et al.  Reachability and time-based path queries in temporal graphs , 2016, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).

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

[24]  Jari Saramäki,et al.  A collection of public transport network data sets for 25 cities , 2018, Scientific Data.

[25]  Ada Wai-Chee Fu,et al.  Minimum Spanning Trees in Temporal Graphs , 2015, SIGMOD Conference.

[26]  Timothy F Welch,et al.  Performance indicators for public transit connectivity in multi-modal transportation networks , 2012 .

[27]  Carlos F. Daganzo,et al.  Structure of Competitive Transit Networks , 2009 .

[28]  Laurent Viennot,et al.  Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons , 2017, SODA.

[29]  Edith Cohen,et al.  Size-Estimation Framework with Applications to Transitive Closure and Reachability , 1997, J. Comput. Syst. Sci..

[30]  Krishna P. Gummadi,et al.  On the evolution of user interaction in Facebook , 2009, WOSN '09.

[31]  Darren M. Scott,et al.  Identifying Critical Road Segments and Measuring System-Wide Robustness in Transportation Networks with Isolating Links: A Link-Based Capacity-Reduction Approach , 2010 .

[32]  Bernard Mans,et al.  Shortest, Fastest, and Foremost Broadcast in Dynamic Networks , 2012, Int. J. Found. Comput. Sci..

[33]  Jure Leskovec,et al.  Governance in Social Media: A Case Study of the Wikipedia Promotion Process , 2010, ICWSM.

[34]  Andrea Marino,et al.  Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games , 2015, Theor. Comput. Sci..

[35]  Matthieu Latapy,et al.  Stream graphs and link streams for the modeling of interactions over time , 2017, Social Network Analysis and Mining.

[36]  Marcelo Dias de Amorim,et al.  Density-Aware Routing in Highly Dynamic DTNs: The RollerNet Case , 2011, IEEE Transactions on Mobile Computing.

[37]  Philippe Flajolet,et al.  Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..

[38]  Bernhard Rieder,et al.  Programmed method: developing a toolset for capturing and analyzing tweets , 2014, Aslib J. Inf. Manag..