Related papers: Harmonic analysis invariants for infinite graphs v…
We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…
Functional analysis, especially the theory of Hilbert spaces and of operators on these, form an important area in mathematics. We formalized the Isabelle/HOL library Complex_Bounded_Operators containing a large amount of theorems about…
This is the first part of a series of papers. The whole series aims to develop the tools for the study of all almost Hermitian symmetric structures in a unified way. In particular, methods for the construction of invariant operators, their…
The concept of complementability is extended from bounded operators to densely defined operators on Hilbert spaces. By introducing appropriate projections and decomposition techniques, a framework is developed for analyzing…
We study the operator theory associated with such infinite graphs $G$ as occur in electrical networks, in fractals, in statistical mechanics, and even in internet search engines. Our emphasis is on the determination of spectral data for a…
A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…
In the field of graph signal processing (GSP), directed graphs present a particular challenge for the "standard approaches" of GSP to due to their asymmetric nature. The presence of negative- or complex-weight directed edges, a graphical…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
Using the spectral theory of weakly convergent sequences of finite graphs, we prove the uniform existence of the integrated density of states for a large class of infinite graphs.
Previously, the graph permanent was introduced as a single-valued invariant for graphs $G$ with $|E(G)| = k(|V(G)|-1)$ for some $k \in \mathbb{Z}_{>0}$. Herein, we construct the extended graph permanent, an infinite sequence for all graphs.…
Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…
We propose a new viewpoint on Hilbert scales extending them by means of all Hilbert spaces that are interpolation ones between spaces on the scale. We prove that this extension admits an explicit description with the help of…
Given a Hermitian vector bundle over an infinite weighted graph, we define the Laplacian associated to a unitary connection on this bundle and study the essential self-adjointness of a perturbation of this Laplacian by an operator-valued…
We characterize the smallest finite spaces with the same homotopy groups of the spheres. Similarly, we describe the minimal finite models of any finite graph. We also develop new combinatorial techniques based on finite spaces to study…
The paper is devoted to establishing relationships between global and local monotonicity, as well as their maximality versions, for single-valued and set-valued mappings between finite-dimensional and infinite-dimensional spaces. We first…
L. A. Bunimovich and B. Z. Webb developed a theory for transforming a finite weighted graph while preserving its spectrum, referred as isospectral reduction theory. In this work we extend this theory to a class of operators on Banach spaces…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
We prove an infinite Ramsey theorem for noncommutative graphs realized as unital self-adjoint subspaces of linear operators acting on an infinite dimensional Hilbert space. Specifically, we prove that if V is such a subspace, then provided…
The infinite-dimensional unitary group U(infinity) is the inductive limit of growing compact unitary groups U(N). In this paper we solve a problem of harmonic analysis on U(infinity) stated in the previous paper math/0109193. The problem…
Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems. We introduce a graph neural network architecture for solving such optimization problems. The architecture is generic; it works for…