A sampling theory for infinite weighted graphs

DOI10.7494/OPMATH.2011.31.2.209MaRDI QIDQ3144638zbMATH OpenOpenAlexFDO

Authors Palle Jorgensen

Publication date 8 December 2012

Published in Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7494/opmath.2011.31.2.209

zbMATH Keywords

Hilbert spaceinterpolationLaplace operatorsamplingShannonweighted graphwhite noiseWiener transform

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Harmonic analysis in one variable (42A99) Toeplitz operators, Hankel operators, Wiener-Hopf operators (47B35) Algebras of unbounded operators; partial algebras of operators (47L60) General topics of discrete mathematics in relation to computer science (68R01) Learning and adaptive systems in artificial intelligence (68T05) Sampling theory in information and communication theory (94A20)

Recommendations

• Compactification of infinite graphs and sampling
• Graph signal sampling and interpolation based on clusters and averages
• Sampling in Paley-Wiener spaces on combinatorial graphs
• Sampling by averages and average splines on Dirichlet spaces and on combinatorial graphs
• Poincaré and Plancherel--Polya Inequalities in Harmonic Analysis on Weighted Combinatorial Graphs

Cited in

(9)

• A low discrepancy sequence on graphs
• System identification in dynamical sampling
• Dynamical sampling
• Compactification of infinite graphs and sampling
• Half sampling on bipartite graphs
• Infinite weighted graphs with bounded resistance metric
• Finite dimensional dynamical sampling: an overview
• Weighting estimation under bipartite incidence graph sampling
• Graph signal sampling and interpolation based on clusters and averages

This page was built for publication: A sampling theory for infinite weighted graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3144638)