Related papers: Graph Structured Operator Inequalities and Tsirels…
We revise the strong convergent Chernoff product formula and extend it, in a Hilbert space, to convergence in the operator-norm topology. Main results deal with the self-adjoint Chernoff product formula. The nonself-adjoint case concerns…
The term Bell's theorem refers to a set of closely related results which imply that quantum mechanics is incompatible with local hidden variable theories. Bell's inequality is the statement that if measurements are performed independently…
Bell inequalities characterize the boundary of the local-realist correlation polytope -- the set of joint probability distributions achievable by classical hidden-variable models. Quantum mechanics exceeds this boundary through…
We study the $p$-\emph{torsion function} and the corresponding $p$-\emph{torsional rigidity} associated with $p$-Laplacians and, more generally, $p$-Schr\"odinger operators, for $1<p<\infty$, on possibly infinite combinatorial graphs. We…
We consider an arbitrary metric graph, to which we glue another graph with edges of lengths proportional to $\varepsilon$, where $\varepsilon$ is a small positive parameter. On such graph, we consider a general self-adjoint second order…
Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…
This paper studies multipartite observables formed from sums of local self-adjoint contractions on tensor product Hilbert spaces. The square of such a sum has a parity structure: after decomposing each local product into commutator and…
Many applications collect a large number of time series, for example, the financial data of companies quoted in a stock exchange, the health care data of all patients that visit the emergency room of a hospital, or the temperature sequences…
We investigate the effect of non-symmetric relatively bounded perturbations on the spectrum of self-adjoint operators. In particular, we establish stability theorems for one or infinitely many spectral gaps along with corresponding…
Neural networks are often represented as graphs of connections between neurons. However, despite their wide use, there is currently little understanding of the relationship between the graph structure of the neural network and its…
In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific…
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…
We define several new types of quantum chromatic numbers of a graph and characterise them in terms of operator system tensor products. We establish inequalities between these chromatic numbers and other parameters of graphs studied in the…
Despite their importance, there is an on-going challenge characterizing multipartite quantum correlations. The Svetlichny and Mermin-Klyshko (MK) inequalities present constraints on correlations in multipartite systems, a violation of which…
We study two subspace systems in a separable infinite-dimensional Hilbert space up to (bounded) isomorphism. One of the main result of this paper is the following: Isomorphism classes of two subspace systems given by graphs of bounded…
Operator-valued concentration inequalities are foundational to the analysis of modern high-dimensional statistics and randomized algorithms. However, standard oracle bounds are frequently limited in practice: they require explicit a priori…
Recently, hetero-functional graph theory (HFGT) has developed as a means to mathematically model the structure of large-scale complex flexible engineering systems. It does so by fusing concepts from network science and model-based systems…
In this notes unbounded regular operators on Hilbert $C^*$-modules over arbitrary $C^*$-algebras are discussed. A densely defined operator $t$ possesses an adjoint operator if the graph of $t$ is an orthogonal summand. Moreover, for a…
Threshold graphs are recursive deterministic network models that have been proposed for describing certain economic and social interactions. One drawback of this graph family is that it has limited generative attachment rules. To mitigate…
Here we introduce connectivity operators, namely, diffusion operators, general Laplacian operators, and general adjacency operators for hypergraphs. These operators are generalisations of some conventional notions of apparently different…