Related papers: Complete Classification of Directed Quantum Graphs…
There is a Turing computable embedding $\Phi$ of directed graphs $A$ in undirected graphs. Moreover, there is a fixed tuple of formulas that give a uniform interpretation; i.e., for all directed graphs $A$, these formulas interpret $A$ in…
We study the graded derivation-based noncommutative differential geometry of the $Z_2$-graded algebra ${\bf M}(n| m)$ of complex $(n+m)\times(n+m)$-matrices with the ``usual block matrix grading'' (for $n\neq m$). Beside the…
Studying the spectral theory of Schroedinger operator on metric graphs (also known as quantum graphs) is advantageous on its own as well as to demonstrate key concepts of general spectral theory. There are some excellent references for this…
We generate new mathematical tools with which to quantify the macroscopic topological structure of large directed networks. This is achieved via a statistical mechanical analysis of constrained maximum entropy ensembles of directed random…
We introduce various notions of quantum symmetry in a directed or undirected multigraph with no isolated vertex and explore relations among them. If the multigraph is single edged (that is, a simple graph where loops are allowed), all our…
Let $K_{m[n]}$ be the complete multipartite graph with $m$ parts, while each part contains $n$ vertices. The orientably-regular embeddings of complete graphs $K_{m[1]}$ have been determined by Biggs (1971) \cite{Big1}, James and Jones…
Bidirected graphs generalize directed and undirected graphs in that edges are oriented locally at every node. The natural notion of the degree of a node that takes into account (local) orientations is that of net-degree. In this paper, we…
We give graphical presentations for the two quantum subgroups of type $G_2$. To do this we use a method of extending a tensor category by embedding the planar algebra of a $\otimes$-generating object into the graph planar algebra of this…
Various quantum-walk based algorithms have been proposed to analyse and rank the centrality of graph vertices. However, issues arise when working with directed graphs --- the resulting non-Hermitian Hamiltonian leads to non-unitary…
Node classification is one of the hottest tasks in graph analysis. Though existing studies have explored various node representations in directed and undirected graphs, they have overlooked the distinctions of their capabilities to capture…
We formalize the treatment of directed (or chiral) quantum walks using Hermitian adjacency matrices, bridging two developing fields of research in quantum information and spectral graph theory. We display results and simulations which…
We study Schr\"odinger operators on compact finite metric graphs subject to $\delta$-coupling and standard boundary conditions. We compare the $n$-th eigenvalues of those self-adjoint realizations and derive an asymptotic result for the…
Call two pairs $(M,N)$ and $(M',N')$ of $m\times n$ matrices over a field $K$, \emph{simultaneously K-equivalent} if there exist square invertible matrices $S,T$ over K, with $M'=SMT$ and $N'=SNT$. Kronecker \cite{Kronecker} has given a…
In this paper we show a correspondence between directed graphs and bipartite undirected graphs with a perfect matching, that allows to study properties of directed graphs through the properties of the corresponding undirected graphs. In…
We present a construction of graph-directed invariant sets of weak contractions in the sense of Matkowski-Rus on semi-metric spaces. We follow the approach by Bessenyei and P\'enzes, which applies the Kuratowski noncompactness measure…
The inductive biases of graph representation learning algorithms are often encoded in the background geometry of their embedding space. In this paper, we show that general directed graphs can be effectively represented by an embedding model…
In this paper, various kinds of invariants of directed graphs are summarized. In the first topic, the invariant w(G) for a directed graph G is introduced, which is primarily defined by S. Chen and X.M. Chen to solve a problem of weak…
We consider two Z/2Z-actions on the Podles generic quantum spheres. They yield, as noncommutative quotient spaces, the Klimek-Lesniewski q-disc and the quantum real projective space, respectively. The C*-algebras of all these quantum spaces…
We investigate a graph-theoretic problem motivated by questions in quantum computing concerning the propagation of information in quantum circuits. A graph $G$ is said to be a bounded extension of its subgraph $L$ if they share the same…
Geometric approaches to network analysis combine simply defined models with great descriptive power. In this work we provide a method for embedding directed acyclic graphs into Minkowski spacetime using Multidimensional scaling (MDS). First…