Related papers: Graph Structured Operator Inequalities and Tsirels…
Accurate prediction of molecular correlation energies from first principles requires resolving the {O}(N^4) electron repulsion integral (ERI) tensor. Existing graph neural network approaches to the electronic structure problem often…
We point out that, when the dimension of the Hilbert space is greater than two, Bell's operators entering the Bell-CHSH inequality exhibit unitarily inequivalent representations. Although the Bell-CHSH inequality turns out to be violated,…
We produce a new proof and extend results by Harrell and Stubbe for the discrete spectrum of a self-adjoint operator. An abstract approach--based on commutator algebra, the Rayleigh-Ritz principle, and an ``optimal'' usage of the…
Nonlocality is one of the key features of quantum physics, which is revealed through the violation of a Bell inequality. In large multipartite systems, nonlocality characterization quickly becomes a challenging task. A common practice is to…
Network topology inference is a prominent problem in Network Science. Most graph signal processing (GSP) efforts to date assume that the underlying network is known, and then analyze how the graph's algebraic and spectral characteristics…
We provide formulas for invariants defined on a tensor product of defining representations of unitary groups, under the action of the product group. This situation has a physical interpretation, as it is related to the quantum mechanical…
In the dimer model, a configuration consists of a perfect matching of a fixed graph. If the underlying graph is planar and bipartite, such a configuration is associated to a height function. For appropriate "critical" (weighted) graphs,…
We consider how to connect a set of disjoint networks to optimize the performance of the resulting composite network. We quantify this performance by the coherence of the composite network, which is defined by an $H_2$ norm of the system.…
This chapter deals with the notion of the resolvent of a self-adjoint operator. We pay special attention to the convergence of unbounded self-adjoint operators in several resolvent senses, and how they are related to the convergence of…
Large graphs abound in machine learning, data mining, and several related areas. A useful step towards analyzing such graphs is that of obtaining certain summary statistics - e.g., or the expected length of a shortest path between two…
We establish a second anti-blocker theorem for non-commutative convex corners, show that the anti-blocking operation is continuous on bounded sets of convex corners, and define optimisation parameters for a given convex corner that…
Graph Neural Networks (GNNs) are attracting growing attention due to their effectiveness and flexibility in modeling a variety of graph-structured data. Exiting GNN architectures usually adopt simple pooling operations (eg. sum, average,…
We consider the space-fractional operator with order $0<\alpha<1$ on the metric star graph. The boundary conditions at the vertices of the metric star graph providing the self-adjointness of the operator are derived. The obtained result is…
We consider a second order self-adjoint operator in a domain which can be bounded or unbounded. The boundary is partitioned into two parts with Dirichlet boundary condition on one of them, and Neumann condition on the other. We assume that…
Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker…
The paper introduces unbounded antilinear operators on Hilbert spaces and develops their fundamental theory. In particular, we establish a closed range theorem, a polar decomposition theorem, and the convexity of the numerical range for…
We consider an algebraic formulation of Quantum Theory and develop a combinatorial model of the Heisenberg-Weyl algebra structure. It is shown that by lifting this structure to the richer algebra of graph operator calculus, we gain a simple…
The celebrated Cheeger's Inequality \cite{am85,a86} establishes a bound on the expansion of a graph via its spectrum. This inequality is central to a rich spectral theory of graphs, based on studying the eigenvalues and eigenvectors of the…
In recent years, there has been considerable interest in estimating conditional independence graphs in the high-dimensional setting. Most prior work has assumed that the variables are multivariate Gaussian, or that the conditional means of…
Matrix representations of quantum operators are computationally complete but often obscure the structural topology of information flow within a quantum circuit \cite{nielsen2000}. In this paper, we introduce a generalized graph-theoretic…