The Power Mean Laplacian for Multilayer Graph Clustering

Antoine Gautier, Francesco Tudisco, Pedro Mercado, Matthias Hein

Publication date: 1 March 2018

Abstract: Multilayer graphs encode different kind of interactions between the same set of entities. When one wants to cluster such a multilayer graph, the natural question arises how one should merge the information different layers. We introduce in this paper a one-parameter family of matrix power means for merging the Laplacians from different layers and analyze it in expectation in the stochastic block model. We show that this family allows to recover ground truth clusters under different settings and verify this in real world data. While computing the matrix power mean can be very expensive for large graphs, we introduce a numerical scheme to efficiently compute its eigenvectors for the case of large sparse graphs.

Has companion code repository: https://github.com/melopeo/PM

This page was built for publication: The Power Mean Laplacian for Multilayer Graph Clustering