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

We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…

The properties of gauge-invariant composite operators and their correlation functions in N=4 SYM are discussed in the analytic superspace formalism. A complete classification of the different types of operators in the theory is given.…

Let $G$ be a finite group and $S$ be a symmetric generating set of $G$ with $|S| = d$. We show that if the undirected Cayley sum graph $C_{\Sigma}(G,S)$ is an expander graph and is non-bipartite, then the spectrum of its normalised…

We develop a shape analysis for reasoning about relational properties of data structures. Both the concrete and the abstract domain are represented by hypergraphs. The analysis is parameterized by user-supplied indexed graph grammars to…

We show that the operational quantum formalism -- the Born rule, L\"uders state updating, quantum interference, non-Markovian effective dynamics, and Bell inequality violation at the Tsirelson bound $2\sqrt{2}$ -- arises within…

We consider branched quantum wires, whose connection rules provide PT-symmetry for the Schrodinger equation on graph. For such PT-symmetric quantum graph we derive general boundary conditions which keep the Hamiltonian as PT-symmetric with…

Graphs serve as generic tools to encode the underlying relational structure of data. Often this graph is not given, and so the task of inferring it from nodal observations becomes important. Traditional approaches formulate a convex inverse…

We demonstrate that any self-adjoint coupling in a quantum graph vertex can be approximated by a family of magnetic Schroedinger operators on a tubular network built over the graph. If such a manifold has a boundary, Neumann conditions are…

We consider magnetic Schroedinger operators on quantum graphs with identical edges. The spectral problem for the quantum graph is reduced to the discrete magnetic Laplacian on the underlying combinatorial graph and a certain Hill operator.…

In this paper we extend the known results of analytic connectivity to non-uniform hypergraphs. We prove a modified Cheeger's inequality and also give a bound on analytic connectivity with respect to the degree sequence and diameter of a…

In this work, we apply the concept about operator connection to consider bivariate random tensor means. We first extend classical Markov and Chebyshev inequalities from a random variable to a random tensor by establishing Markov inequality…

Different approaches to quantum gravity converge in predicting the existence of a minimal scale of length. This raises the fundamental question as to whether and how an intrinsic limit to spatial resolution can affect quantum mechanical…

The aim of this work is to study the Airy and Schr\"odinger operators on looping-edge graphs, a class of metric graphs consisting of a circle and a finite number $N$ of infinite half-lines attached to a common vertex. For the Airy operator,…

The set $\mathcal{Q}$ of quantum correlations is the collection of all possible probability distributions on measurement outcomes achievable by space-like separated parties sharing a quantum state. Since the original work of Tsirelson…

Traditional methods for the analysis of compositional data consider the log-ratios between all different pairs of variables with equal weight, typically in the form of aggregated contributions. This is not meaningful in contexts where it is…

On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity…

In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…

Graph-based approximation methods are of growing interest in many areas, including transportation, biological and chemical networks, financial models, image processing, network flows, and more. In these applications, often a basis for the…

Treatment effect estimation from observational data has attracted significant attention across various research fields. However, many widely used methods rely on the unconfoundedness assumption, which is often unrealistic due to the…

We review quantum chaos on graphs. We construct a unitary operator which represents the quantum evolution on the graph and study its spectral and wavefunction statistics. This operator is the analogue of the classical evolution operator on…