221 citations · 869 across the 56 of their papers we have counts for
6 papers · 1 filter
A linear streaming algorithm for community detection in very large networks
Alexandre Hollocou, Julien Maudet, Thomas Bonald +1
In this paper, we introduce a novel community detection algorithm in graphs, called SCoDA (Streaming Community Detection Algorithm), based on an edge streaming setting. This algori…
Improving PageRank for Local Community Detection
Alexandre Hollocou, Thomas Bonald, Marc Lelarge
Community detection is a classical problem in the field of graph mining. While most algorithms work on the entire graph, it is often interesting in practice to recover only the com…
Clustering from Sparse Pairwise Measurements
Alaa Saade, Marc Lelarge, Florent Krzakala +1
We consider the problem of grouping items into clusters based on few random pairwise comparisons between the items. We introduce three closely related algorithms for this task: a b…
Spectral Detection in the Censored Block Model
Alaa Saade, Florent Krzakala, Marc Lelarge +1
We consider the problem of partially recovering hidden binary variables from the observation of (few) censored edge weights, a problem with applications in community detection, cor…
Streaming, Memory Limited Algorithms for Community Detection
Se-Young Yun, Marc Lelarge, Alexandre Proutiere
In this paper, we consider sparse networks consisting of a finite number of non-overlapping communities, i.e. disjoint clusters, so that there is higher density within clusters tha…
Community Detection in the Labelled Stochastic Block Model
Simon Heimlicher, Marc Lelarge, Laurent Massoulié
We consider the problem of community detection from observed interactions between individuals, in the context where multiple types of interaction are possible. We use labelled stoc…