Abstract
In this short note we strengthen a former result of Bolla (2011), where in a multipartition (clustering) of a graph’s vertices we estimated the pairwise discrepancies of the clusters with the normalized adjacency spectra. There we used the definition of Alon et al. (2010) for the volume-regularity of the cluster pairs. Since then, in Bolla (2016) we defined the so-called k-way discrepancy of a k-clustering and estimated the kth largest (in absolute value) normalized adjacency eigenvalue with an increasing function of it. In the present paper, we estimate the new discrepancy measure with this eigenvalue. Putting these together, we are able to establish a relation between the large spectral gap (as for the (k−1)th and kth non-trivial normalized adjacency eigenvalues) and the sudden decrease between the k−1 and k-way discrepancies. It makes rise to a new paradigm of spectral clustering, which minimizes the multiway discrepancy.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.