Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
From MaRDI portal
Recommendations
Cites work
- A combinatorial Laplacian with vertex weights
- A simple min-cut algorithm
- Approximating spectral clustering via sampling: a review
- Bounds for the least Laplacian eigenvalue of a signed graph
- Clustering With Multi-Layer Graphs: A Spectral Perspective
- Contour and texture analysis for image segmentation
- Developments in the theory of graph spectra
- Diffusion maps
- Discrete calculus. Applied analysis on graphs for computational science
- Discrete Signal Processing on Graphs
- Discrete Signal Processing on Graphs: Frequency Analysis
- Eigenvalues and expanders
- Eigenvalues of Laplacians on a Closed Riemannian Manifold and Its Nets
- Eigenvectors of random matrices: A survey
- Geometric Methods in Signal and Image Analysis
- Geometrical structure of Laplacian eigenfunctions
- Graph clustering
- Graph sparsification by effective resistances
- Graphical models
- Graphical models, exponential families, and variational inference
- scientific article; zbMATH DE number 5852541 (Why is no real title available?)
- scientific article; zbMATH DE number 5784188 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Isoperimetric numbers of graphs
- Kron Reduction of Graphs With Applications to Electrical Networks
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Laplacians and the Cheeger inequality for directed graphs
- Non-negative and sparse spectral clustering
- On the Laplacian spectra of product graphs
- On the notion of balance of a signed graph
- On the Shift Operator, Graph Frequency, and Optimal Filtering in Graph Signal Processing
- Singular value decompositions of complex symmetric matrices
- Spectra of graphs
- Spectral distances of graphs
- Spectral partitioning works: planar graphs and finite element meshes
- Spectrum of the 1-Laplacian and Cheeger's constant on graphs
- The electrical resistance of a graph captures its commute and cover times
- Vertex-frequency analysis of graph signals
- Which graphs are determined by their spectrum?
Cited in
(7)- Data Analytics on Graphs Part II: Signals on Graphs
- Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications
- A class of doubly stochastic shift operators for random graph signals and their boundedness
- Spectral graph wavelet packets frames
- Diffusion optical tomography reconstruction based on convex–nonconvex graph total variation regularization
- Can we feel the shape of a graph? Can a graph make us feel the shape of data?
- Graph-regularized tensor regression: a domain-aware framework for interpretable modeling of multiway data on graphs
This page was built for publication: Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094176)
