Optimal Laplacian regularization for sparse spectral community detection

12/03/2019
by   Lorenzo Dall'Amico, et al.
0

Regularization of the classical Laplacian matrices was empirically shown to improve spectral clustering in sparse networks. It was observed that small regularizations are preferable, but this point was left as a heuristic argument. In this paper we formally determine a proper regularization which is intimately related to alternative state-of-the-art spectral techniques for sparse graphs.

READ FULL TEXT
research
01/25/2019

Optimized Deformed Laplacian for Spectrum-based Community Detection in Sparse Heterogeneous Graphs

Spectral clustering is one of the most popular, yet still incompletely u...
research
03/20/2020

A unified framework for spectral clustering in sparse graphs

This article considers spectral community detection in the regime of spa...
research
06/05/2018

Understanding Regularized Spectral Clustering via Graph Conductance

This paper uses the relationship between graph conductance and spectral ...
research
11/18/2021

The self-consistent field iteration for p-spectral clustering

The self-consistent field (SCF) iteration, combined with its variants, i...
research
06/02/2020

Good pivots for small sparse matrices

For sparse matrices up to size 8 × 8, we determine optimal choices for p...
research
12/05/2013

Impact of regularization on Spectral Clustering

The performance of spectral clustering can be considerably improved via ...
research
08/28/2017

Towards Spectral Sparsification of Simplicial Complexes Based on Generalized Effective Resistance

As a generalization of the use of graphs to describe pairwise interactio...

Please sign up or login with your details

Forgot password? Click here to reset