Sampling, filtering and sparse approximations on combinatorial graphs (Q620417)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sampling, filtering and sparse approximations on combinatorial graphs |
scientific article |
Statements
Sampling, filtering and sparse approximations on combinatorial graphs (English)
0 references
19 January 2011
0 references
This paper firstly proves a Poincaré and Plancherel type inequality on graphs. Then by combining this inequality with the ideas of Duffin and Shaeffer's theory, the authors give a sampling theorem. Finally with the filtering procedure, the authors obtain sparse approximations to functions in \(L_2(G)\).
0 references
sparse approximation
0 references
combinatorial graphs
0 references
Paley-Wiener spaces
0 references
