Related papers: Connectivity for quantum graphs via quantum adjace…
We develop two approaches to Quantum (or Non-commutative) Graphs based on arbitrary von Neumann algebras $M\subseteq\mathcal B(H)$: one looking at operator bimodules of Hilbert--Schmidt (instead of bounded) operators, and the second looking…
The goal of this paper is to describe the connections between Perron-Frobenius theory and vertex maps on graphs. In particular, it is shown how Perron-Frobenius theory gives results about the sets of integers that can arise as periods of…
Entangled quantum networks provide great flexibilities and scalabilities for quantum information processing or quantum Internet. Most of results are focused on the nonlocalities of quantum networks. Our goal in this work is to explore new…
Quantum connections are defined by parallel transport operators acting on a Hilbert space. They transport tangent operators along paths in parameter space. The metric tensor of a Riemannian manifold is replaced by an inner product of pairs…
We present a mapping of dynamical graphs and, in particular, the graphs used in the Quantum Graphity models for emergent geometry, into an Ising hamiltonian on the line graph of a complete graph with a fixed number of vertices. We use this…
We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrodinger equation on…
We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that when a quantum network is described by such a graph, the network is efficiently controllable, in…
Graph kernels are often used in bioinformatics and network applications to measure the similarity between graphs; therefore, they may be used to construct efficient graph classifiers. Many graph kernels have been developed thus far, but to…
Fiber graphs of Gr\"obner bases from contingency tables are important in statistical hypothesis testing, where one studies random walks on these graphs using the Metropolis-Hastings algorithm. The connectivity of the graphs has implications…
We revisit the construction of quantum Riemannian geometries on graphs starting from a hermitian metric compatible connection, which always exists. We use this method to find quantum Levi-Civita connections on the $n$-leg star graph for…
In this paper, we study the analytic connectivity of a $k$-uniform hypergraph $H$, denoted by $\alpha(H)$. In addition to computing the analytic connectivity of a complete $k$-graph, we present several bounds on analytic connectivity that…
The spectral properties of the adjacency (connectivity) and distance matrix for various types of networks: exponential, scale-free (Albert--Barabasi) and classical random ones (Erdos--Renyi) are evaluated. The graph spectra for dense graph…
We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…
We show that numerical approximations of Kolmogorov complexity (K) applied to graph adjacency matrices capture some group-theoretic and topological properties of graphs and empirical networks ranging from metabolic to social networks. That…
The join $X\vee Y$ of two graphs $X$ and $Y$ is the graph obtained by joining each vertex of $X$ to each vertex of $Y$. We explore the behaviour of a continuous quantum walk on a weighted join graph having the adjacency matrix or Laplacian…
The control of the quantum transport is an issue of current interest for the construction of new devices. In this work, we investigate this possibility in the realm of quantum graphs. The study allows the identification of two distinct…
We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrix theory. We also define a classical phase space for the…
We establish a sharp edge-connectivity estimate for graphs with non-negative Bakry-\'Emery curvature. This leads to a geometric criterion for the existence of a perfect matching. Precisely, we show that any regular graph with non-negative…
We consider metric graphs with a uniform lower bound on the edge lengths but no further restrictions. We discuss how to describe every local self-adjoint Laplace operator on such graphs by boundary conditions in the vertices given by…
We prove a number of results to the effect that generic quantum graphs (defined via operator systems as in the work of Duan-Severini-Winter / Weaver) have few symmetries: for a Zariski-dense open set of tuples $(X_1,\cdots,X_d)$ of…