# Multiway Spectral Graph Partitioning: Cut Functions, Cheeger Inequalities, and a Simple Algorithm

The problem of multiway partitioning of an undirected graph is considered. A spectral method is used, where the k > 2 largest eigenvalues of the normalized adjacency matrix (equivalently, the k smallest eigenvalues of the normalized graph Laplacian) are computed. It is shown that the information necessary for partitioning is contained in the subspace spanned by the k eigenvectors. The partitioning is encoded in a matrix Ψ in indicator form, which is computed by approximating the eigenvector matrix by a product of Ψ and an orthogonal matrix. A measure of the distance of a graph to being k-partitionable is defined, as well as two cut (cost) functions, for which Cheeger inequalities are proved; thus the relation between the eigenvalue and partitioning problems is established. Numerical examples are given that demonstrate that the partitioning algorithm is efficient and robust.

research
01/23/2013

### Improved Cheeger's Inequality: Analysis of Spectral Partitioning Algorithms through Higher Order Spectral Gap

Let ϕ(G) be the minimum conductance of an undirected graph G, and let 0=...
research
05/09/2015

### Relations Between Adjacency and Modularity Graph Partitioning

In this paper the exact linear relation between the leading eigenvector ...
research
12/27/2019

### Approximate Graph Spectral Decomposition with the Variational Quantum Eigensolver

Spectral graph theory is a branch of mathematics that studies the relati...
research
04/04/2023

### q-Partitioning Valuations: Exploring the Space Between Subadditive and Fractionally Subadditive Valuations

For a set M of m elements, we define a decreasing chain of classes of no...
research
10/26/2019

### Pseudospectra of Loewner Matrix Pencils

Loewner matrix pencils play a central role in the system realization the...
research
09/12/2013

### Partitioning into Expanders

Let G=(V,E) be an undirected graph, lambda_k be the k-th smallest eigenv...
research
11/11/2022

### Spectral Triadic Decompositions of Real-World Networks

A fundamental problem in mathematics and network analysis is to find con...