Euclidean Distances, soft and spectral Clustering on Weighted Graphs

François Bavaud

We define a class of Euclidean distances on weighted graphs, enabling to perform thermodynamic soft graph clustering. The class can be constructed form the "raw coordinates" encoun…