相关论文: Graph Structured Operator Inequalities and Tsirels…

Neural networks that satisfy invariance with respect to input permutations have been widely studied in machine learning literature. However, in many applications, only a subset of all input permutations is of interest. For heterogeneous…

Many interesting examples of operator algebras, both self-adjoint and non-self-adjoint, can be constructed from directed graphs. In this survey, we overview the construction of $C^*$-algebras from directed graphs and from two…

Given a self-adjoint involution J on a Hilbert space H, we consider a J-self-adjoint operator L=A+V on H where A is a possibly unbounded self-adjoint operator commuting with J and V a bounded J-self-adjoint operator anti-commuting with J.…

(This is a report for the Proceedings of ``Journees Relativistes 1993'' written in September 1993. Containes a short description of the results published elsewhere in the joint paper with A. Ashtekar) Integral calculus on the space of gauge…

The algebraic connectivity of a graph $G$ in a finite dimensional real normed linear space $X$ is a geometric counterpart to the Fiedler number of the graph and can be regarded as a measure of the rigidity of the graph in $X$. We analyse…

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…

We continue the study of non-commutative operator graphs generated by resolutions of identity covariant with respect to unitary actions of the circle group and the Heisenber-Weyl group as well. It is shown that the graphs generated by the…

A finite dimensional operator that commutes with some symmetry group admits quotient operators, which are determined by the choice of associated representation. Taking the quotient isolates the part of the spectrum supporting the chosen…

We study a non-exchangeable multi-agent system and rigorously derive a strong form of the mean-field limit. The convergence of the connection weights and the initial data implies convergence of large-scale dynamics toward a deterministic…

Causal graphs may inform covariate adjustment for estimating causal effects and improve estimation efficiency by exploiting the graphical structure. In many applications, however, the target causal parameter may not be point-identified due…

Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric…

!-graphs provide a means of reasoning about infinite families of string diagrams and have proven useful in manipulation of (co)algebraic structures like Hopf algebras, Frobenius algebras, and compositions thereof. However, they have…

Tsirelson showed that $2\sqrt{2}$ is the maximum value that CHSH expression can take for quantum-correlations [B. S.Tsirelson, Lett. Math. Phys, 4 (1980) 93]. This bound simply follows from the algebra of observables. Recently by exploiting…

Higher-rank graph generalisations of the Popescu-Poisson transform are constructed, allowing us to develop a dilation theory for higher rank operator tuples. These dilations are joint dilations of the families of operators satisfying…

We establish new integral inequalities for the numerical radius and the operator norm of bounded linear operators on Hilbert spaces. Our results refine classical triangle-type and operator matrix inequalities by incorporating convex…

As graph representations of data emerge in multiple domains, data analysts need to be able to intelligently select among a magnitude of different data graphs based on the effects different graph operators have on them. Exhaustive execution…

Given a densely defined and closed operator $A$ acting on a complex Hilbert space $\mathcal{H}$, we establish a one-to-one correspondence between its closed extensions and subspaces $\mathfrak{M}\subset\mathcal{D}(A^*)$, that are closed…

In this paper, we consider three typical problems on a locally finite connected graph. The first one is to study the Bochner formula for the Laplacian operator on a locally finite connected graph. We use the Bochner formula to derive the…

Functional graphical models explore dependence relationships of random processes. This is achieved through estimating the precision matrix of the coefficients from the Karhunen-Loeve expansion. This paper deals with the problem of…

We describe a new technique for obtaining Tsirelson bounds, or upper bounds on the quantum value of a Bell inequality. Since quantum correlations do not allow signaling, we obtain a Tsirelson bound by maximizing over all no-signaling…