Related papers: Gram matrices of reproducing kernel Hilbert spaces…
Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. The quality of the embeddings is usually determined by how well the geometry…
A frame is a system of vectors $S$ in Hilbert space $\mathscr{H}$ with properties which allow one to write algorithms for the two operations, analysis and synthesis, relative to $S$, for all vectors in $\mathscr{H}$; expressed in…
In this paper we show that, for a class of countable graphs, every representation of the associated graph algebra in a separable Hilbert space is unitarily equivalent to a representation obtained via branching systems.
We study interpolating sequences of $d$-tuples of matrices, by looking at the commuting and the non-commuting case separately. In both cases, we will give a characterization of such sequences in terms of separation conditions on suitable…
The problem of establishing out-of-sample bounds for the values of an unkonwn ground-truth function is considered. Kernels and their associated Hilbert spaces are the main formalism employed herein along with an observational model where…
We consider matrix problems in Hilbert spaces (orthoscalar representations of quivers and posets). A criterion of tameness of the problem of classification of indecomposable orthoscalar representations of a quiver is given.
Multipliers of reproducing kernel Hilbert spaces can be characterized in terms of positivity of $n \times n$ matrices analogous to the classical Pick matrix. We study for which reproducing kernel Hilbert spaces it suffices to consider…
This study shows how Aronszajn's theory of reproducing kernels can be of use for the construction the Hilbert spaces of quantum theory. We show that the Feynman propagator is an example of a reproducing kernel under a boundedness condition.…
We propose graph kernels based on subgraph matchings, i.e. structure-preserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al., 2009) in general can not be…
Graph vertex sampling set selection aims at selecting a set of ver-tices of a graph such that the space of graph signals that can be reconstructed exactly from those samples alone is maximal. In this context, we propose to extend sampling…
Sub-Bergman Hilbert spaces are analogues of de Branges-Rovnyak spaces in the Bergman space setting. They are reproducing kernel Hilbert spaces contractively contained in the Bergman space of the unit disk. K. Zhu analyzed sub-Bergman…
Subgraph isomorphism counting is known as #P-complete and requires exponential time to find the accurate solution. Utilizing representation learning has been shown as a promising direction to represent substructures and approximate the…
We show that problems which have finite integer index and satisfy a requirement we call treewidth-bounding admit linear kernels on the class of $H$-topological-minor free graphs, for an arbitrary fixed graph $H$. This builds on earlier…
This paper studies the construction of a refinement kernel for a given operator-valued reproducing kernel such that the vector-valued reproducing kernel Hilbert space of the refinement kernel contains that of the given one as a subspace.…
Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…
This is a survey on reproducing kernel Krein spaces and their interplay with operator valued Hermitian kernels. Existence and uniqueness properties are carefully reviewed. The approach we follow in this survey uses a more abstract but very…
Much recent work has addressed the solution of a family of partial differential equations by computing the inverse operator map between the input and solution space. Toward this end, we incorporate function-valued reproducing kernel Hilbert…
A number of applications in engineering, social sciences, physics, and biology involve inference over networks. In this context, graph signals are widely encountered as descriptors of vertex attributes or features in graph-structured data.…
We study reproducing kernel Hilbert spaces introduced as ranges of generalized Ces\`aro-Hardy operators, in one real variable and in one complex variable. Such spaces can be seen as formed by absolutely continuous functions on the positive…
We provide the first mathematically complete derivation of the Nystr\"om method for low-rank approximation of indefinite kernels and propose an efficient method for finding an approximate eigendecomposition of such kernel matrices. Building…