A link stream is a sequence of triplets (t, u, v) indicating that an interaction occurred between u and v at time t.
We adapt the classical notion of cliques in graphs to such link streams: for a given duration ??, 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. This allow to detect temporally and structurally dense interaction.
We generalize a method previously introduced to find ??-cliques. The main goal is to overcome the parameter ?? when computing. We propose an adaptation of the previous algorithm in order to find all ??-cliques that can be maximal for a range of ??.


Arnoux Thibaud Phd

Young Researchers e-session


Photos by : Derek K. Miller