Regularity based spectral clustering and mapping the Fiedler-carpet

by   Marianna Bolla, et al.
University of Michigan
Middlebury College
Budapest University of Technology and Economics
Renyi Institute of Mathematics

Spectral clustering is discussed from many perspectives, by extending it to rectangular arrays and discrepancy minimization too. Near optimal clusters are obtained with singular value decomposition and with the weighted k-means algorithm. In case of rectangular arrays, this means enhancing the method of correspondence analysis with clustering, and in case of edge-weighted graphs, a normalized Laplacian based clustering. In the latter case it is proved that a spectral gap between the (k-1)th and kth smallest positive eigenvalues of the normalized Laplacian matrix gives rise to a sudden decrease of the inner cluster variances when the number of clusters of the vertex representatives is 2^k-1, but only the first k-1 eigenvectors, constituting the so-called Fiedler-carpet, are used in the representation. Application to directed migration graphs is also discussed.


page 1

page 2

page 3

page 4


Incremental Method for Spectral Clustering of Increasing Orders

The smallest eigenvalues and the associated eigenvectors (i.e., eigenpai...

Stochastic Parallelizable Eigengap Dilation for Large Graph Clustering

Large graphs commonly appear in social networks, knowledge graphs, recom...

Percolated stochastic block model via EM algorithm and belief propagation with non-backtracking spectra

Whereas Laplacian and modularity based spectral clustering is apt to den...

Spectral Clustering by Ellipsoid and Its Connection to Separable Nonnegative Matrix Factorization

This paper proposes a variant of the normalized cut algorithm for spectr...

Koopman-based spectral clustering of directed and time-evolving graphs

While spectral clustering algorithms for undirected graphs are well esta...

Notes on Elementary Spectral Graph Theory. Applications to Graph Clustering Using Normalized Cuts

These are notes on the method of normalized graph cuts and its applicati...

Please sign up or login with your details

Forgot password? Click here to reset