Spectrum Consistent Coarsening Approximates Edge Weights

DOI10.1137/21m1458119zbMath1519.05102MaRDI QIDQ6116660

No author found.

Publication date: 16 August 2023

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

eigenvaluesspectral graph theorygraph coarseninggraph approximation

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hearing the clusters of a graph: A distributed algorithm
• Enabling scalable spectral clustering for image segmentation
• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• Limitations of Chung Lu random graph generation
• Graph coarsening: from scientific computing to machine learning
• Relaxation-Based Coarsening and Multiscale Graph Organization
• Eigenfunctions of the Laplacian on a Riemannian Manifold
• Perturbation Bounds for Matrix Eigenvalues
• One cannot hear the shape of a drum
• Can One Hear the Shape of a Drum?