相关论文: Variational Splines and Paley--Wiener Spaces on Co…
For Paley-Wiener functions on weighted combinatorial finite or infinite graphs we develop a weighted sampling theory in which samples are defined as inner products with weight functions (measuring devices). Three reconstruction methods are…
A notion of Paley-Wiener spaces is introduced on combinatorial graphs. It is shown that functions from some of these spaces are uniquely determined by their values on some sets of vertices which are called the uniqueness sets. Such…
We prove Poincar\'e and Plancherel-Polya inequalities for weighted {\ell}p -spaces on weighted graphs in which the constants are explicitly expressed in terms of some geometric characteristics of a graph. We use Poincar\'e type inequality…
We extend the classical theory of variational interpolating splines to the case of compact Riemannian manifolds. Our consideration includes in particular such problems as interpolation of a function by its values on a discrete set of points…
Discrete versions of the Laplace and Dirac operators haven been studied in the context of combinatorial models of statistical mechanics and quantum field theory. In this paper we introduce several variations of the Laplace and Dirac…
Polynomial invariants are fundamental objects in analysis on Lie groups and symmetric spaces. Invariant differential operators on symmetric spaces are described by Weyl group invariant polynomial. In this article we give a simple criterion…
We prove a sampling theorem for infinite-dimensional Paley-Wiener spaces on graphs which allows for stable frame reconstruction. We prove that all sampling sets for a fixed Paley-Wiener space are complements of lambda-sets (i.e. sets where…
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…
We first develop a general framework for Laplace operators defined in terms of the combinatorial structure of a simplicial complex. This includes, among others, the graph Laplacian, the combinatorial Laplacian on simplicial complexes, the…
Let $M$ be a Riemmanian manifold with bounded geometry. We consider a generalization of Paley-Wiener functions and Lagrangian splines on $M$. An analog of the Paley-Wiener theorem is given. We also show that every Paley-Wiener function on a…
In this paper we develop the theory of variable exponent Hardy spaces associated with discrete Laplacians on infinite graphs. Our Hardy spaces are defined by square integrals, atomic and molecular decompositions. Also we study boundedness…
It has been shown that Paley-Wiener functions may be recovered from their values on a complete interpolating sequence. This paper explores the same phenomenon, and gives a sufficient condition on a function $\phi(x)$, called an…
In this paper we address sampling and approximation of functions on combinatorial graphs. We develop filtering on graphs by using Schr\"odinger's group of operators generated by combinatorial Laplace operator. Then we construct a sampling…
Deriving meaningful representations from complex, high-dimensional data in unsupervised settings is crucial across diverse machine learning applications. This paper introduces a framework for multi-scale graph network embedding based on…
Polynomial invariants are fundamental objects in analysis on Lie groups and symmetric spaces. Invariant differential operators on symmetric spaces are described by Weyl group invariant polynomial. In this article we give a simple criterion…
The description of the Paley-Wiener space for compactly supported smooth functions $C^\infty_c(G)$ on a semi-simple Lie group $G$ involves certain intertwining conditions that are difficult to handle. In the present paper, we make them…
In this note a general way to develop a cardinal interpolant for $l^2$-data on the integer lattice $Z^n$ is shown. Further, a parameter is introduced which allows one to recover the original Paley-Weiner function from which the data came.
Under consideration methods of constructing trigonometric interpolation splines of two variables on rectangular areas. These methods are easily generalized to the case of trigonometric interpolation splines of several variables on such…
We consider decompositions of digraphs into edge-disjoint paths and describe their connection with the $n$-th Weyl algebra of differential operators. This approach gives a graph-theoretic combinatorial view of the normal ordering problem…
Generalized integer splines on a graph $G$ with integer edge weights are integer vertex labelings such that if two vertices share an edge in $G$, the vertex labels are congruent modulo the edge weight. We introduce collapsing operations…