The Power Mean Laplacian for Multilayer Graph Clustering

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 form 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 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 the matrix power mean is computationally expensive to compute we introduce a scalable numerical scheme that allows to efficiently compute the eigenvectors of the matrix power mean of large sparse graphs.

Please cite this work as:

@InProceedings{pmlr-v84-mercado18a,
  title = {The Power Mean Laplacian for Multilayer Graph Clustering},
  author = {Mercado, Pedro and Gautier, Antoine and Tudisco, Francesco and Hein, Matthias},
  booktitle = {Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics},
  pages = {1828--1838},
  year = {2018},
  editor = {Amos Storkey and Fernando Perez-Cruz},
  volume = {84},
  series = {Proceedings of Machine Learning Research}
}

Keywords: Spectral clustering multi-layer multiplex networks graph Laplacian matrix means power mean