Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges

We consider the problem of analyzing social network data sets in which the edges of the network have timestamps, and we wish to analyze the subgraphs formed from edges in contiguous subintervals of these timestamps. We provide data structures for these problems that use near-linear preprocessing time, linear space, and sublogarithmic query time to handle queries that ask for the number of connected components, number of components that contain cycles, number of vertices whose degree equals or is at most some predetermined value, number of vertices that can be reached from a starting set of vertices by time-increasing paths, and related queries.

[1]  D. Watts,et al.  Origins of Homophily in an Evolving Social Network1 , 2009, American Journal of Sociology.

[2]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[3]  Joseph JáJá,et al.  Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting , 2004, ISAAC.

[4]  David Eppstein,et al.  Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics , 2010, ArXiv.

[5]  Bernard Chazelle,et al.  Lower bounds for orthogonal range searching: part II. The arithmetic model , 1990, JACM.

[6]  Shiva Kintali,et al.  Betweenness Centrality : Algorithms and Lower Bounds , 2008, ArXiv.

[7]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[8]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[9]  Wouter de Nooy,et al.  Networks of action and events over time. A multilevel discrete-time event history model for longitudinal network data , 2011, Soc. Networks.

[10]  Robert E. Tarjan,et al.  Making data structures persistent , 1986, STOC '86.

[11]  Mihai Patrascu.  Lower bounds for 2-dimensional range counting , 2007, STOC '07.

[12]  A. Rapoport.  Spread of information through a population with socio-structural bias: I. Assumption of transitivity , 1953 .

[13]  Corinna Cortes,et al.  Computational Methods for Dynamic Graphs , 2003 .

[14]  JanardanRavi,et al.  Further results on generalized intersection searching problems , 1995 .

[15]  Daniel A. McFarland,et al.  Dynamic Network Visualization1 , 2005, American Journal of Sociology.

[16]  Ulrik Brandes,et al.  Networks Evolving Step by Step: Statistical Analysis of Dyadic Event Data , 2009, 2009 International Conference on Advances in Social Network Analysis and Mining.

[17]  T. Wong,et al.  Sexual network analysis of a gonorrhoea outbreak , 2004, Sexually Transmitted Infections.

[18]  James E. Foster.  A Number System without a Zero-Symbol , 1947 .

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

[20]  Leonidas J. Guibas,et al.  Fractional cascading: I. A data structuring technique , 1986, Algorithmica.

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

[22]  Michiel H. M. Smid,et al.  Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization , 1993, WADS.

[23]  Anatol Rapoport,et al.  Spread of information through a population with socio-structural bias: III. Suggested experimental procedures , 1954 .

[24]  Michael E. Saks,et al.  The cell probe complexity of dynamic data structures , 1989, STOC '89.

[25]  David Eppstein,et al.  Journal of Graph Algorithms and Applications the H-index of a Graph and Its Application to Dynamic Subgraph Statistics , 2022 .

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

[27]  Michiel H. M. Smid,et al.  Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization , 1995, J. Algorithms.

[28]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[29]  P. Bearman,et al.  Chains of Affection: The Structure of Adolescent Romantic and Sexual Networks1 , 2004, American Journal of Sociology.

[30]  James Moody,et al.  The Importance of Relationship Timing for Diffusion , 2002 .

[31]  Xiang-Yang Li,et al.  Ranking of Closeness Centrality for Large-Scale Social Networks , 2008, FAW.

[32]  S Q Muth,et al.  Sexual network structure as an indicator of epidemic phase. , 2002, Sexually transmitted infections.

[33]  Lada A. Adamic,et al.  Coevolution of network structure and content , 2011, WebSci '12.

[34]  Edoardo M. Airoldi,et al.  A Survey of Statistical Network Models , 2009, Found. Trends Mach. Learn..

[35]  David Eppstein,et al.  Dynamic graph algorithms , 2010 .

[36]  Diego Garlaschelli,et al.  Patterns of link reciprocity in directed networks. , 2004, Physical review letters.

[37]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[38]  James G. Oxley,et al.  Matroid theory , 1992 .

[39]  Carter T. Butts,et al.  4. A Relational Event Framework for Social Action , 2008 .

[40]  R. Rothenberg,et al.  Risk network structure in the early epidemic phase of HIV transmission in Colorado Springs , 2002, Sexually transmitted infections.

[41]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[42]  Michael L. Fredman,et al.  Surpassing the Information Theoretic Bound with Fusion Trees , 1993, J. Comput. Syst. Sci..