35 citations · 65 across the 5 of their papers we have counts for
Showing 2018Show 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.SI2018★ 35 cited
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…