CLASSIFICATION OF MULTIGRAPHS VIA SPECTRAL TECHNIQUES
Abstract
Classification problems of the vertices of large multigraphs (hypergraphs or weighted graphs) can be easily handled by means of linear algebraic tools. For this purpose nocion of the Laplacian of multigraphs will be introduced, the eigenvectors belonging to k consecutive eigenvalues of which define optimal k-dimensional Euclidean representation of the vertices. In this way perturbation results are obtained for the minimal (k+1)-cuts of multigraphs (where k is an arbitrary integer between 1 and the number of vertices). The (k+1)-variance of the optimal k-dimensional representatives is estimated from above by the k smallest positive eigenvalues and by the gap in the spectrum between the kth and (k+1)th positive eigenvalues in increasing order. These results are of statistical character. However, they are useful and well-adopted to automatic computation in the case of large multigraphs when one is not interested in strict structural properties and, on the other hand, usual enumeration algorithms are very time-demanding.
Keywords:
Laplacian spectra of graphs, Euclidean representations, optimal k-partitions, perturbation resultsHow to Cite
Issue
Section
License
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (see The Effect of Open Access). As soon as the paper is accepted, finally submitted and edited, the paper will appear in the "OnlineFirst" page of the journal, thus from this point no other internet-based publication is necessary.

