Modularity spectra, eigen-subspaces, and structure of weighted graphs

Authors:
Marianna Bolla
Affiliations:
-
Venue:
European Journal of Combinatorics
Year:
2014

Citing 8
Cited 0

Eigen values and expanders

Combinatorica
Spectra and optimal partitions of weighted graphs

Discrete Mathematics
Spectral Methods for Automatic Multiscale Data Clustering

CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Generalized quasirandom graphs

Journal of Combinatorial Theory Series B
Quasi-random graphs with given degree sequences

Random Structures & Algorithms
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions

SIAM Journal on Computing
Finitely forcible graphons

Journal of Combinatorial Theory Series B
Testability of minimum balanced multiway cut densities

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The role of the normalized modularity matrix in finding homogeneous cuts will be presented. We also discuss the testability of the structural eigenvalues and that of the subspace spanned by the corresponding eigenvectors of this matrix. In the presence of a spectral gap between the k-1 largest absolute value eigenvalues and the remainder of the spectrum, this in turn implies the testability of the sum of the inner variances of the k clusters that are obtained by applying the k-means algorithm for the appropriately chosen vertex representatives.