Revealing contact patterns among high-school students using maximal cliques in link streams

Interaction traces between humans are usually rich in information concerning the patterns and habits of individuals. Such datasets have been recently made available, and more and more researchers address the new questions raised by this data. A link stream is a sequence of triplets (t, u, v) indicating that an interaction occurred between u and v at time t, and as such is a natural representation of these data. We generalize the classical notion of cliques in graphs to such link streams: for a given Δ, a Δ-clique is a set of nodes and a time interval such that all pairs of nodes in this set interact at least every Δ during this time interval. We proceed to compute the maximal Δ-cliques on a real-world dataset of contact among students, and show how it can bring new interpretation to patterns of contact.

[1]  Thrasyvoulos Spyropoulos,et al.  Putting contacts into context: mobility modeling beyond inter-contact times , 2011, MobiHoc '11.

[2]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[3]  StrashDarren,et al.  Listing All Maximal Cliques in Large Sparse Real-World Graphs , 2013 .

[4]  Petter Holme.  Temporal Networks , 2014, Encyclopedia of Social Network Analysis and Mining.

[5]  Eric Fleury,et al.  A unifying model for representing time-varying graphs , 2014, 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA).

[6]  Thrasyvoulos Spyropoulos,et al.  A complex network analysis of human mobility , 2011, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[7]  Norishige Chiba,et al.  Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..

[8]  Alain Barrat,et al.  Contact Patterns among High School Students , 2014, PloS one.

[9]  Matthieu Latapy,et al.  Computing maximal cliques in link streams , 2015, Theor. Comput. Sci..

[10]  Ciro Cattuto,et al.  Dynamics of Person-to-Person Interactions from Distributed RFID Sensor Networks , 2010, PloS one.

[11]  Christophe Diot,et al.  Dissemination in opportunistic social networks: the role of temporal communities , 2012, MobiHoc '12.

[12]  David Eppstein,et al.  Listing All Maximal Cliques in Large Sparse Real-World Graphs , 2011, JEAL.

[13]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[14]  Akira Tanaka,et al.  The worst-case time complexity for generating all maximal cliques and computational experiments , 2006, Theor. Comput. Sci..

[15]  David Avis,et al.  Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[16]  Matthieu Latapy,et al.  Identifying roles in an IP network with temporal and structural density , 2014, 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[17]  Andrea Baronchelli,et al.  Modeling human dynamics of face-to-face interaction networks , 2013, Physical review letters.