The 1-Laplacian Cheeger Cut: Theory and Algorithms

DOI10.4208/jcm.1506-m2014-0164zbMath1349.05203arXiv1603.01687OpenAlexW2963585117MaRDI QIDQ2992631

Sihong Shao, Dong Zhang, Kung-Ching Chang

Publication date: 10 August 2016

Published in: Journal of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.01687

zbMATH Keywords

optimizationconvergenceCheeger constanteigenvalue problems1-Laplace operatorspectral graph theoryspectral clusteringgraph Laplaciangraph cut

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (16)

Nonsmooth critical point theory and applications to the spectral graph theory ⋮ Gradient flows in metric random walk spaces ⋮ Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology ⋮ Spectrum of signless 1-Laplacian on simplicial complexes ⋮ The Cheeger cut and Cheeger problem in metric graphs ⋮ First eigenvalue estimates of Dirichlet-to-Neumann operators on graphs ⋮ Cheeger‐like inequalities for the largest eigenvalue of the graph Laplace operator ⋮ Nonlinear evolution equation associated with hypergraph Laplacian ⋮ Pseudo-orthogonality for graph 1-Laplacian eigenvectors and applications to higher Cheeger constants and data clustering ⋮ EXISTENCE OF GLOBAL SOLUTIONS TO SOME NONLINEAR EQUATIONS ON LOCALLY FINITE GRAPHS ⋮ Nodal domains of eigenvectors for 1-Laplacian on graphs ⋮ Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs ⋮ The total variation flow in metric random walk spaces ⋮ Dirichlet \(p\)-Laplacian eigenvalues and Cheeger constants on symmetric graphs ⋮ A Cheeger cut for uniform hypergraphs ⋮ The 1-Yamabe equation on graphs

This page was built for publication: The 1-Laplacian Cheeger Cut: Theory and Algorithms