Measuring the stability of spectral clustering

DOI10.1016/j.laa.2020.10.015zbMath1460.65065arXiv1903.05193OpenAlexW3094591634MaRDI QIDQ2228130

Christian Lubich, Eleonora Andreotti, Nicola Guglielmi, Dominik Edelmann

Publication date: 16 February 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

spectral clusteringmatrix nearness problemclustering stabilitystructured eigenvalue optimization

Mathematics Subject Classification ID

Applications of graph theory (05C90) Numerical mathematical programming methods (65K05) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (2)

Multiway Spectral Graph Partitioning: Cut Functions, Cheeger Inequalities, and a Simple Algorithm ⋮ Quantifying the structural stability of simplicial homology

Cites Work

• Computing the nearest correlation matrix--a problem from finance
• Stability radius for structured perturbations and the algebraic Riccati equation
• Computing a nearest symmetric positive semidefinite matrix
• On semidefinite relaxations for the block model
• A structured pseudospectral method for \(\mathcal {H}_{\infty}\)-norm computation of large-scale descriptor systems
• Low rank differential equations for Hamiltonian matrix nearness problems
• Distance Problems for Linear Dynamical Systems
• Differential Equations for Roaming Pseudospectra: Paths to Extremal Points and Boundary Tracking
• A Survey of Statistical Network Models
• Matrix Analysis
• Matrix Stabilization Using Differential Equations
• Constrained Graph Partitioning via Matrix Differential Equations
• On the Nearest Singular Matrix Pencil
• Analysis of Multivariate and High-Dimensional Data
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Measuring the stability of spectral clustering