Finding remarkably dense sequences of contacts in link streams - Sorbonne Université Access content directly
Journal Articles Social Network Analysis and Mining Year : 2016

Finding remarkably dense sequences of contacts in link streams

Noe Gaumont
Connectez-vous pour contacter l'auteur
Clémence Magnien
Matthieu Latapy


A link stream is a set of quadruplets (b, e, u, v) meaning that a link exists between u and v from time b to time e. Link streams model many real-world situations like contacts between individuals, connections between devices, and others. Much work is currently devoted to the generalization of classical graph and network concepts to link streams. We argue that the density is a valuable notion for understanding and characterizing links streams. We propose a method to capture specific groups of links that are structurally and temporally densely connected and show that they are meaningful for the description of link streams. To find such groups, we use classical graph community detection algorithms, and we assess obtained groups. We apply our method to several real-world contact traces (captured by sensors) and demonstrate the relevance of the obtained structures.
Fichier principal
Vignette du fichier
Gaumont_2016_Finding_remarkably.pdf (3.79 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01390043 , version 1 (31-10-2016)



Noe Gaumont, Clémence Magnien, Matthieu Latapy. Finding remarkably dense sequences of contacts in link streams. Social Network Analysis and Mining, 2016, 6 (1), pp.87. ⟨10.1007/s13278-016-0396-z⟩. ⟨hal-01390043⟩
253 View
230 Download



Gmail Facebook X LinkedIn More