Related papers: Separating Functions, Spectral Graph Theory and Lo…
The aim of this paper is to give an overview of the spectral theories associated with the notions of holomorphicity in dimension greater than one. A first natural extension is the theory of several complex variables whose Cauchy formula is…
In this paper, we introduce the notion of reproducing kernel Hilbert spaces for graphs and the Gram matrices associated with them. Our aim is to investigate the Gram matrices of reproducing kernel Hilbert spaces. We provide several bounds…
In graph learning, maps between graphs and their subgraphs frequently arise. For instance, when coarsening or rewiring operations are present along the pipeline, one needs to keep track of the corresponding nodes between the original and…
Let $H_0$ and $H$ be self-adjoint operators in a Hilbert space. In the scattering theory framework, we describe the essential spectrum of the difference $\varphi(H)-\varphi(H_0)$ for piecewise continuous functions $\varphi$. This…
Federated graph learning collaboratively learns a global graph neural network with distributed graphs, where the non-independent and identically distributed property is one of the major challenges. Most relative arts focus on traditional…
Suppose H is a space of functions on X. If H is a Hilbert space with reproducing kernel then that structure of H can be used to build distance functions on X. We describe some of those and their interpretations and interrelations. We also…
How can sparse graph theory be extended to large networks, where algorithms whose running time is estimated using the number of vertices are not good enough? I address this question by introducing 'Local Separators' of graphs. Applications…
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenvectors of matrices associated with graphs to study them. In this paper, we present a collection of $20$ topics in spectral graph theory,…
This paper outlines a program in what one might call spectral sheaf theory --- an extension of spectral graph theory to cellular sheaves. By lifting the combinatorial graph Laplacian to the Hodge Laplacian on a cellular sheaf of vector…
We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries…
We explore a connection between the Finslerian area functional and well-investigated Cartan functionals to prove new Bernstein theorems, uniqueness and removability results for Finsler-minimal graphs, as well as enclosure theorems and…
We prove local convergence results for the spectra and pseudospectra of sequences of linear operators acting in different Hilbert spaces and converging in generalised strong resolvent sense to an operator with possibly non-empty essential…
We prove that the solution of certain linear stochastic differential equations in Hilbert spaces, namely those with bounded operators as well as the conservative stochastic Schr\"odinger equations, can be obtained - along the lines of the…
In this paper we would like to show the interrelation between the different mathematical theories concerning the Schur interpolation problem, contractions in Hilbert spaces, pseudocontinuation and Darlington synthesis. The main objects of…
The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…
This paper discusses a generalization of spectral representations related to convex one-homogeneous regularization functionals, e.g. total variation or $\ell^1$-norms. Those functionals serve as a substitute for a Hilbert space structure…
The usual formulas for the correlation functions in orthogonal and symplectic matrix models express them as quaternion determinants. From this representation one can deduce formulas for spacing probabilities in terms of Fredholm…
We consider various regular graphs defined on the set of elements of given rank of a finite polar space. It is likely that no two such graphs, of the same kind but defined for different ranks, can have the same degree. We shall prove this…
These informal notes are concerned with spaces of functions in various situations, including continuous functions on topological spaces, holomorphic functions of one or more complex variables, and so on.
To a function with values in the power set of a pre-ordered, separated locally convex space a family of scalarizations is given which completely characterizes the original function. A concept of a Legendre-Fenchel conjugate for set-valued…