相关论文: Graph Reconstruction and Quantum Statistical Mecha…
In this paper we consider the problem to reconstruct a $k$-uniform hypergraph from its line graph. In general this problem is hard. We solve this problem when the number of hyperedges containing any pair of vertices is bounded. Given an…
The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an…
A general analytical approach to the statistical description of quantum graph spectra based on the exact periodic orbit expansions of quantum levels is discussed. The exact and approximate expressions obtained in \cite{Anima} for the…
We define a notion of quantum automorphism group of Graph C*-algebras for finite, connected graphs. Under the assumption that the underlying graph does not have any multiple edge or loop, the quantum automorphism group of underlying…
In this paper, we consider the graph alignment problem, which is the problem of recovering, given two graphs, a one-to-one mapping between nodes that maximizes edge overlap. This problem can be viewed as a noisy version of the well-known…
We review some important algebraic structures which appear in a priori remote areas of Mathematics, such as control theory, numerical methods for solving differential equations, and renormalization in Quantum Field Theory. Starting with…
In machine learning, graph embedding algorithms seek low-dimensional representations of the input network data, thereby allowing for downstream tasks on compressed encodings. Recently, within the framework of network renormalization,…
Let $G=(V,A)$ be a digraph. With every subset $X$ of $V$, we associate the subdigraph $G[X]=(X,A\cap (X\times X))$ of $G$ induced by $X$. Given a positive integer $k$, a digraph $G$ is $(\leq k)$-half-reconstructible if it is determined up…
We introduce Quantum Graph Neural Networks (QGNN), a new class of quantum neural network ansatze which are tailored to represent quantum processes which have a graph structure, and are particularly suitable to be executed on distributed…
One of the fundamental and most-studied algorithmic problems in distributed computing on networks is graph coloring, both in bounded-degree and in general graphs. Recently, the study of this problem has been extended in two directions.…
A general treatment of the spectral problem of quantum graphs and tight-binding models in finite Hilbert spaces is given. The direct spectral problem and the inverse spectral problem are written in terms of simple algebraic equations…
We focus on the algorithm underlying the main result of [A. Mestre, R. Oeckl, Generating loop graphs via Hopf algebra in quantum field theory. J. Math. Phys., 47, 122302, 2006]. This is an algebraic formula to generate all connected graphs…
We formulate a theory of generalized Fock spaces which underlies the different forms of quantum statistics such as ``infinite'', Bose-Einstein and Fermi-Dirac statistics. Single-indexed systems as well as multi-indexed systems that cannot…
Reconstruction of large-sized data from small-sized ones is an important problem in information science, and a typical example is the image super-resolution reconstruction in computer vision. Combining machine learning and quantum…
This paper is devoted to the study of unbounded derivations on Banach quasi *-algebras with a particular emphasis to the case when they are infinitesimal generators of one parameter automorphisms groups. Both of them, derivations and…
Extending a classic result of Johnson and Newman, this paper provides a matrix characterization for two generalized cospectral graphs with a pair of generalized cospectral vertex-deleted subgraphs. As an application, we present a new…
The graph projection of a hypergraph is a simple graph with the same vertex set and with an edge between each pair of vertices that appear in a hyperedge. We consider the problem of reconstructing a random $d$-uniform hypergraph from its…
A $k$-deck of a (coloured) graph is a multiset of its induced $k$-vertex subgraphs. Given a graph $G$, when is it possible to reconstruct with high probability a uniformly random colouring of its vertices in $r$ colours from its $k$-deck?…
The quantum mechanics is proved to admit no hidden-variable in 1960s, which means the quantum systems are contextual. Revealing the mathematical structure of quantum mechanics is a significant task. We develop the approach of partial…
A vertex-subset graph problem $Q$ defines which subsets of the vertices of an input graph are feasible solutions. The reconfiguration version of a vertex-subset problem $Q$ asks whether it is possible to transform one feasible solution for…