HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Finding remarkably dense sequences of contacts in link streams

Noe Gaumont 1, * Clémence Magnien 1 Matthieu Latapy 1
* Corresponding author
1 ComplexNetworks
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download

Contributor : Gestionnaire Hal-Upmc Connect in order to contact the contributor
Submitted on : Monday, October 31, 2016 - 2:12:30 PM
Last modification on : Tuesday, November 16, 2021 - 5:22:36 AM


Files produced by the author(s)



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



Record views


Files downloads