Sampling low-spectrum signals on graphs via cluster-concentrated modes: examples

10/29/2021
by   Joseph D. Lakey, et al.
0

We establish frame inequalities for signals in Paley–Wiener spaces on two specific families of graphs consisting of combinations of cubes and cycles. The frame elements are localizations to cubes, regarded as clusters in the graphs, of vertex functions that are eigenvectors of certain spatio–spectral limiting operators on graph signals.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/05/2017

Graph sampling with determinantal processes

We present a new random sampling strategy for k-bandlimited signals defi...
research
06/06/2023

Infinite families of k-vertex-critical (P_5, C_5)-free graphs

A graph is k-vertex-critical if χ(G)=k but χ(G-v)<k for all v∈ V(G). We ...
research
03/26/2023

Permutation Inequalities for Walks in Graphs

Using spectral graph theory, we show how to obtain inequalities for the ...
research
09/26/2018

Sampling Theory for Graph Signals on Product Graphs

In this paper, we extend the sampling theory on graphs by constructing a...
research
03/09/2020

Sampling on Graphs: From Theory to Applications

The study of sampling signals on graphs, with the goal of building an an...
research
08/15/2018

Forbidden cycles in metrically homogeneous graphs

Aranda, Bradley-Williams, Hubička, Karamanlis, Kompatscher, Konečný and ...
research
08/05/2021

Generalized splines on graphs with two labels and polynomial splines on cycles

A generalized spline on a graph G with edges labeled by ideals in a ring...

Please sign up or login with your details

Forgot password? Click here to reset