Spectrum Consistent Coarsening Approximates Edge Weights
From MaRDI portal
Recommendations
- Graph Weight Allocation to Meet Laplacian Spectral Constraints
- Optimal design of edge weights in transforming low-frequency graph signals into the spectral domain
- Graph approximations to the Laplacian spectra
- Spectral analysis for weighted iterated triangulations of graphs
- Edge-Cuts of Optimal Average Weights
- Reconstruction of weighted graphs by their spectrum
- Refined weight of edges in normal plane maps
- Coarsening unstructured meshes by edge contraction
- Edge-weighted centroidal Voronoi tessellations
Cites work
- Can One Hear the Shape of a Drum?
- Developments on spectral characterizations of graphs
- Eigenfunctions of the Laplacian on a Riemannian manifold
- Enabling scalable spectral clustering for image segmentation
- Graph coarsening: from scientific computing to machine learning
- Graph reduction with spectral and cut guarantees
- Hearing the clusters of a graph: A distributed algorithm
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 6403512 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- scientific article; zbMATH DE number 3035866 (Why is no real title available?)
- Limitations of Chung Lu random graph generation
- One cannot hear the shape of a drum
- Perturbation Bounds for Matrix Eigenvalues
- Relaxation-based coarsening and multiscale graph organization
- Which graphs are determined by their spectrum?
Cited in
(3)
This page was built for publication: Spectrum Consistent Coarsening Approximates Edge Weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6116660)
