Generalized designs on graphs: Sampling, spectra, symmetries

DOI10.1002/jgt.22485zbMath1495.05178arXiv1803.02235OpenAlexW2969222669WikidataQ127353142 ScholiaQ127353142MaRDI QIDQ5110655

Stefan Steinerberger

Publication date: 21 May 2020

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

samplingspherical designspectrumsymmetriespackingheat kernelgraph Laplacianquadrature pointsLebedev quadrature

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22) Graph designs and isomorphic decomposition (05C51)

Related Items (9)

Optimal and extremal graphical designs on regular graphs associated with classical parameters ⋮ Graphical designs and gale duality ⋮ Graphical designs and extremal combinatorics ⋮ Eigenpolytope Universality and Graphical Designs ⋮ Transport and Interface: An Uncertainty Principle for the Wasserstein Distance ⋮ A low discrepancy sequence on graphs ⋮ Codes, cubes, and graphical designs ⋮ Quadrature points via heat kernel repulsion ⋮ Numerical integration on graphs: Where to sample and how to weigh

This page was built for publication: Generalized designs on graphs: Sampling, spectra, symmetries