Sparse graphical designs via linear programming
From MaRDI portal
Cites work
- A graph discretization of the Laplace-Beltrami operator
- A sampling theorem on homogeneous manifolds
- An Exact Algorithm for Maximum Entropy Sampling
- Codes, cubes, and graphical designs
- Constrained maximum-entropy sampling
- Discrete Signal Processing on Graphs: Sampling Theory
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Eigenpolytope Universality and Graphical Designs
- Fast Graph Sampling Set Selection Using Gershgorin Disc Alignment
- From graph to manifold Laplacian: the convergence rate
- Generalized designs on graphs: Sampling, spectra, symmetries
- Graph Laplacians and their convergence on random neighborhood graphs
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3708924 (Why is no real title available?)
- scientific article; zbMATH DE number 3529328 (Why is no real title available?)
- scientific article; zbMATH DE number 1544182 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- scientific article; zbMATH DE number 3194652 (Why is no real title available?)
- Introduction to graph signal processing
- Iterative methods in combinatorial optimization.
- Nonlinear manifold learning for early warnings in financial markets
- Optimal asymptotic bounds for spherical designs
- Quantitative analysis of financial system fragility based on manifold curvature
- Sampling in Paley-Wiener spaces on combinatorial graphs
- Sampling of Graph Signals With Successive Local Aggregations
- Signals on Graphs: Uncertainty Principle and Sampling
- Spectral limitations of quadrature rules and generalized spherical designs
- Spherical codes and designs
- Stable high-order quadrature rules with equidistant points
- Strictly positive definite functions on spheres in Euclidean spaces
- Surface fitting with scattered noisy data on Euclidean D-space and on the sphere
- The product of two high-frequency graph Laplacian eigenfunctions is smooth
- Well-separated spherical designs
This page was built for publication: Sparse graphical designs via linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988619)