Consistent sampling of Paley-Wiener functions on graphons
Hartmut F\"uhr, Mahya Ghandehari

TL;DR
This paper develops sampling methods for Paley-Wiener functions on graphons, extending graph sampling techniques to a continuous setting and establishing conditions for consistent sampling as graphons converge.
Contribution
It introduces a generalized sampling framework for Paley-Wiener functions on graphons and provides conditions for sampling consistency with graphon convergence.
Findings
Sampling methods are adapted for graphon setting.
Conditions for sampling consistency are derived.
Framework generalizes graph sampling to continuous graph limits.
Abstract
We study sampling methods for Paley-Wiener functions on graphons, thereby adapting and generalizing methods initially developed for graphs to the graphon setting. We then derive conditions under which such a sampling estimate is consistent with graphon convergence.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsadvanced mathematical theories · Mathematical Analysis and Transform Methods · Spectral Theory in Mathematical Physics
