Related papers: A Normal Graph Algebra
Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…
A graph-theoretic method, simpler than existing ones, is used to characterize the minimal set of monomial generators for the integral closure of any algebra of polynomials generated by quadratic monomials. The toric ideal of relations…
The theory of linear transports along paths in vector bundles, generalizing the parallel transports generated by linear connections, is developed. The normal frames for them are defined as ones in which their matrices are the identity…
We perform a massive evaluation of neural networks with architectures corresponding to random graphs of various types. We investigate various structural and numerical properties of the graphs in relation to neural network test accuracy. We…
Many applications, ranging from natural to social sciences, rely on graphlet analysis for the intuitive and meaningful characterization of networks employing micro-level structures as building blocks. However, it has not been thoroughly…
A class of associative (super) algebras is presented, which naturally generalize both the symmetric algebra $Sym(V)$ and the wedge algebra $\wedge (V)$, where $V$ is a vector-space. These algebras are in a bijection with those subsets of…
Directed acyclic graphical models (DAGs) are often used to describe common structural properties in a family of probability distributions. This paper addresses the question of classifying DAGs up to an isomorphism. By considering Gaussian…
We prove a spectral theorem for bimodules in the context of graph C*-algebras. A bimodule over a suitable abelian algebra is determined by its spectrum (i.e., its groupoid partial order) iff it is generated by the Cuntz-Krieger partial…
We consider an evolution algebra which corresponds to a bisexual population with a set of females partitioned into finitely many different types and the males having only one type. We study basic properties of the algebra. This algebra is…
The space of derivations of finite dimensional evolution algebras associated to graphs over a field with characteristic zero has been completely characterized in the literature. In this work we generalize that characterization by describing…
In this note we extend the construction of a $C^*$-algebra associated to a self-similar graph to the case of arbitrary countable graphs. We reduce the problem to the row-finite case with no sources, by using a desingularization process.…
We study the congeniality property of algebras, as defined by Bao, He, and Zhang, in order to establish a version of Auslander's theorem for various families of filtered algebras. It is shown that the property is preserved under homomorphic…
We study the normal map for plane projective curves, i.e., the map associating to every regular point of the curve the normal line at the point in the dual space. We first observe that the normal map is always birational and then we use…
Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. From an arbitrary basis $\mathcal B$ of $H^1(A(\Gamma),\mathbb F)$ over an arbitrary field, we construct a natural graph $\Gamma_{\mathcal B}$…
In this short note we make a few remarks on a class of generalized incidence matrices whose matroids do not depend on the orientation of the underlying graph and natural commutative algebras associated to such matrices.
Since their introduction by Kipf and Welling in $2017$, a primary use of graph convolutional networks is transductive node classification, where missing labels are inferred within a single observed graph and its feature matrix. Despite the…
For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…
In this paper we propose a graph superalgebra which is the supersymmetric analogue of Leavitt path algebras. We find a basis for these superalgebras and characterize when they have polynomial growth.
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in…
A characterization is given for directed graphs that yield graph $C^*$-algebras with continuous trace. This is established for row-finite graphs with no sources first using a groupoid approach, and extended to the general case via the…