35 citations · 65 across the 5 of their papers we have counts for
5 papers
Weighted Spectral Embedding of Graphs
Thomas Bonald, Alexandre Hollocou, Marc Lelarge
We present a novel spectral embedding of graphs that incorporates weights assigned to the nodes, quantifying their relative importance. This spectral embedding is based on the firs…
Hierarchical Graph Clustering using Node Pair Sampling
Thomas Bonald, Bertrand Charpentier, Alexis Galland +1
We present a novel hierarchical graph clustering algorithm inspired by modularity-based clustering techniques. The algorithm is agglomerative and based on a simple distance between…
A Streaming Algorithm for Graph Clustering
Alexandre Hollocou, Julien Maudet, Thomas Bonald +1
We introduce a novel algorithm to perform graph clustering in the edge streaming setting. In this model, the graph is presented as a sequence of edges that can be processed strictl…
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…