Related papers: Wreath product of matrices
A $\mathbb{T}$-gain graph is a simple graph in which a unit complex number is assigned to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency matrix is defined canonically, and is…
A new product construction of graphs and digraphs, based on the standard box product of graphs and called the separated box product, is presented, and several of its properties are discussed. Questions about the symmetries of the product…
The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…
We derive Donsker-Vardhan type results for functionals of the occupation times when the underlying random walk on $\mathbb Z^d$ is in the domain of attraction of an operator-stable law on $\mathbb R^d$. Applications to random walks on…
The representation of graphs is commonly based on the adjacency matrix concept. This formulation is the foundation of most algebraic and computational approaches to graph processing. The advent of deep learning language models offers a wide…
We develop a new algebraic framework to reason about languages of Mazurkiewicz traces. This framework supports true concurrency and provides a non-trivial generalization of the wreath product operation to the trace setting. A novel local…
We investigate joint spectral characteristics of a family of matrices $\mathcal F $, associated with products in the semigroup generated by $\mathcal F$. In the literature, extremal measures such as the well-known joint spectral radius and…
We present methods of calculating statistics generating functions over the colored permutation groups, and generalizing known theorems from the symmetric groups to general colored permutations groups.
As a discrete analogue of Kac's celebrated question on "hearing the shape of a drum", and towards a practical graph isomorphism test, it is of interest to understand which graphs are determined up to isomorphism by their spectrum (of their…
We study the spectrum of the product of two Toeplitz operators. Assume that the symbols of these operators are continuous and real-valued and that one of them is non-negative. We prove that the spectrum of the product of finite section…
The palette of a vertex v in a graph G is the set of colors assigned to the edges incident to v. The palette index of G is the minimum number of distinct palettes among the vertices, taken over all proper edge colorings of G. This paper…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
A new matrix product, called the semi-tensor product (STP), is briefly reviewed. The STP extends the classical matrix product to two arbitrary matrices. Under STP the set of matrices becomes a monoid (semi-group with identity). Some related…
Given a circulant matrix $\mathrm{circ}(c,a,0,0,...,0,a)$, $a\ne 0$, of order~$n$, we ``border'' it from left and from above by constant column and row, respectively, and we set the left top entry to be $-nc$. This way we get a~particular…
In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…
Multiplication of a sparse matrix with another (dense or sparse) matrix is a fundamental operation that captures the computational patterns of many data science applications, including but not limited to graph algorithms, sparsely connected…
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…
The lamplighter group over $\mathbb Z$ is the wreath product $\mathbb Z_q \wr \mathbb Z$. With respect to a natural generating set, its Cayley graph is the Diestel-Leader graph $DL(q,q)$. We study harmonic functions for the "simple"…
This work develops a methodical approach to counting of walks on cartesian products, biproducts, symmetric and exterior powers and bipowers, Schur operations, coverings and semicoverings of weighted graphs. For weight and root lattices of…
In 2003, van Dam and Haemers posed a fundamental question in spectral graph theory: does there exist a ``sensible'' matrix whose spectrum determines a random graph up to isomorphism? This paper introduces the class of {\em natural graph…