Equivalent spectral theory for fundamental graph cut problems
Abstract
We introduce and develop equivalent spectral graph theory for several fundamental graph cut problems including maxcut, mincut, Cheeger cut, anti-Cheeger cut, dual Cheeger problem and their useful variants. A specified strategy for achieving an equivalent eigenproblem is proposed for a general graph cut problem via the set-pair Lov\'asz extension and the Dinkelbach scheme. For a class of 2-cut and 3-cut problems, we reveal the intrinsic difference-of-submodularity for the fractional formulations and show that their set-pair Lov\'asz extensions yield equivalent difference-of-convex structures. Building on the Dinkelbach scheme, we finally establish a unified research roadmap for nonlinear spectral theory that provides a one-to-one correspondence between certain eigenpairs and the optimal graph cut problems. The finer structure of the eigenvectors, the Courant nodal domain theorem and the graphic feature of eigenvalues are studied systematically in the setting of these new nonlinear eigenproblems.
Cite
@article{arxiv.2411.11077,
title = {Equivalent spectral theory for fundamental graph cut problems},
author = {Sihong Shao and Chuan Yang and Dong Zhang and Weixi Zhang},
journal= {arXiv preprint arXiv:2411.11077},
year = {2026}
}