相关论文: Graph Reconstruction and Quantum Statistical Mecha…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…
Many degree sequences can only be realised in graphs that contain a `ds-completable card', defined as a vertex-deleted subgraph in which the erstwhile neighbours of the deleted vertex can be identified from their degrees, if one knows the…
We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…
Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data…
Quantum information geometry studies families of quantum states by means of differential geometry. A new approach is followed with the intention to facilitate the introduction of a more general theory in subsequent work. To this purpose,…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
It is a well-known fact in K-theory that the rapidly decreasing matrices of countable size form an associative topological algebra whose set of quasi-invertible elements is open, and such that the quasi-inversion map is continuous. We…
Classically, Tannaka-Krein duality allows us to reconstruct a (co)algebra from its category of representation. In this paper we present an approach that allows us to generalise this theory to the setting of Banach spaces. This leads to…
Network reconstruction consists in retrieving the hidden interaction structure of a system from observations. Many reconstruction algorithms have been proposed, although less research has been devoted to describe their theoretical…
Graphlets are subgraphs rooted at a fixed vertex. The number of occurrences of graphlets aligned to a particular vertex, called graphlet degree sequence (gds), gives a topological description of the surrounding of the analyzed vertex.…
The problem of graph reconstruction has been studied in its various forms over the years. In particular, the Reconstruction Conjecture, proposed by Ulam and Kelly in 1942, has attracted much research attention and yet remains one of the…
We describe computer searches that prove the graph reconstruction conjecture for graphs with up to 13 vertices and some limited classes on larger sizes. We also investigate the reconstructibility of tournaments up to 13 vertices, digraphs…
In distance query reconstruction, we wish to reconstruct the edge set of a hidden graph by asking as few distance queries as possible to an oracle. Given two vertices $u$ and $v$, the oracle returns the shortest path distance between $u$…
The language of operator algebras is of great help for the formulation of questions and answers in quantum statistical mechanics. In Chapter 1 we present a minimal mathematical introduction to operator algebras, with physical applications…
Embedding graphs in a geographical or latent space, i.e.\ inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph visualization. We…
We consider the dynamics of relativistic spin-half particles in quantum graphs with transparent branching points. The system is modeled by combining the quantum graph concept with the one of transparent boundary conditions applied to the…
We undertake a study of the notion of a quantum graph over arbitrary finite-dimensional $C^*$-algebras $B$ equipped with arbitrary faithful states. Quantum graphs are realised principally as either certain operators on $L^2(B)$, the quantum…
We define the Bloch spectrum of a quantum graph to be the collection of the spectra of a family of Schrodinger operators parametrized by the cohomology of the quantum graph. We show that the Bloch spectrum determines the Albanese torus, the…
In numerous graph signal processing applications, data is often missing for a variety of reasons, and predicting the missing data is essential. In this paper, we consider data on graphs modeled as bandlimited graph signals. Predicting or…
A graph is $\ell$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $\ell$ vertices. We prove that $3$-regular graphs are $2$-reconstructible.