Related papers: Variational Splines and Paley--Wiener Spaces on Co…
Graph-based approximation methods are of growing interest in many areas, including transportation, biological and chemical networks, financial models, image processing, network flows, and more. In these applications, often a basis for the…
We develop a local polynomial spline interpolation scheme for arbitrary spline order on bounded intervals. Our method's local formulation, effective boundary considerations and optimal interpolation error rate make it particularly useful…
Given a point configuration A, we uncover a connection between polynomial-reproducing spline spaces over subsets of conv(A) and fine zonotopal tilings of the zonotope Z(V) associated to the corresponding vector configuration. This link…
The de Branges spaces of entire functions generalise the classical Paley-Wiener space of square summable bandlimited functions. Specifically, the square norm is computed on the real line with respect to weights given by the values of…
This paper investigates a variational model for splines in the image metamorphosis model for the smooth interpolation of key frames in the space of images. The Riemannian manifold of images based on the metamorphosis model defines shortest…
Let $R$ be a commutative ring with identity. The involutory Cayley graph $\mathcal{G}(R)$ of $R$ is defined as the graph whose vertex set is the set of elements of $R$, where two vertices $a$ and $b$ are adjacent exactly when $(a-b)^2=1$.…
Motivated by applications in data science, we study partial differential equations on graphs. By a classical fixed-point argument, we show existence and uniqueness of solutions to a class of nonlocal continuity equations on graphs. We…
We develop real Paley-Wiener theorems for classes ${\mathcal S}_\omega$ of ultradifferentiable functions and related $L^{p}$-spaces in the spirit of Bang and Andersen for the Schwartz class. We introduce results of this type for the…
Existing approaches to solving combinatorial optimization problems on graphs suffer from the need to engineer each problem algorithmically, with practical problems recurring in many instances. The practical side of theoretical computer…
Differential operators acting on functions defined on graphs by different studies do not form a consistent framework for the analysis of real or complex functions in the sense that they do not satisfy the Leibniz rule of any order. In this…
In this paper, various kinds of invariants of directed graphs are summarized. In the first topic, the invariant w(G) for a directed graph G is introduced, which is primarily defined by S. Chen and X.M. Chen to solve a problem of weak…
This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…
For any given graph G = (V,E) we define in a certain way a new graph G(x,y,z) with the vertex set V\cup E depending on parameters x,y,z from {0,1, +, -} and call graph G(x,y,z) the (x,y,z)-transformation of G. It turns out that if G is an…
The graph Laplacian is a fundamental object in the analysis of and optimization on graphs. This operator can be extended to a simplicial complex $K$ and therefore offers a way to perform ``signal processing" on $p$-(co)chains of $K$.…
Graph neural networks (GNNs) provide a powerful and scalable solution for modeling continuous spatial data. However, they often rely on Euclidean distances to construct the input graphs. This assumption can be improbable in many real-world…
Graph neural networks (GNNs) have been used effectively in different applications involving the processing of signals on irregular structures modeled by graphs. Relying on the use of shift-invariant graph filters, GNNs extend the operation…
Continuous spline functions are defined as piecewise polynomials on the faces of a polyhedral complex that agree on the intersections of two faces. Splines are used in approximation theory and numerical analysis, with applications in data…
These are lecture notes for the Current Developments in Mathematics conference at Harvard, November, 2011. We discuss topological, probabilistic and combinatorial aspects of the Laplacian on a graph embedded on a surface. The three main…
We introduce a non-backtracking Laplace operator for graphs and we investigate its spectral properties. With the use of both theoretical and computational techniques, we show that the spectrum of this operator captures several structural…
Graph-based analysis holds both theoretical and applied significance, attracting considerable attention from researchers and yielding abundant results in recent years. However, research on fractional problems remains limited, with most of…