290 citations · 787 across the 47 of their papers we have counts for
52 papers
BeWater: Effective Protesters Navigate Watersheds in Street Networks
Guillaume Moinard, Matthieu Latapy
During social movements, protesters need to gather with limited communication means and limited knowledge other than what they observe in their direct surroundings. We propose BeWa…
Trivial Graph Features and Classical Learning are Enough to Detect Random Anomalies
Matthieu Latapy, Stephany Rajeh
Detecting anomalies in link streams that represent various kinds of interactions is an important research topic with crucial applications. Because of the lack of ground truth data,…
Improving flocking behaviors in street networks with vision
Guillaume Moinard, Matthieu Latapy
We improve a flocking model on street networks introduced in a previous paper. We expand the field of vision of walkers, making the model more realistic. Under such conditions, we…
Fast and Robust Flocking of Protesters on Street Networks
Guillaume Moinard, Matthieu Latapy
We present a simple model of protesters scattered throughout a city who want to gather into large and mobile groups. This model relies on random walkers on a street network that fo…
Mapping low-resolution edges to high-resolution paths: the case of traffic measurements in cities
Bastien Legay, Matthieu Latapy
We consider the following problem : we have a high-resolution street network of a given city, and low-resolution measurements of traffic within this city. We want to associate to e…
Link Streams as a Generalization of Graphs and Time Series
Esteban Bautista, Matthieu Latapy
A link stream is a set of possibly weighted triplets (t, u, v) modeling that u and v interacted at time t. Link streams offer an effective model for datasets containing both tempor…