46 citations · 192 across the 23 of their papers we have counts for
3 papers · 1 filter
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…
Learning Graph Representations by Dendrograms
Thomas Bonald, Bertrand Charpentier
Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical c…
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…