35 citations · 65 across the 5 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2018★ 1 cited
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…
cs.LG2017★ 3 cited
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…