相关论文: Wreath product of matrices

We present a comprehensive extension of the latent position network model known as the random dot product graph to accommodate multiple graphs -- both undirected and directed -- which share a common subset of nodes, and propose a method for…

It is shown that an undirected graph $G$ is cospectral with the Hermitian adjacency matrix of a mixed graph $D$ obtained from a subgraph $H$ of $G$ by orienting some of its edges if and only if $H=G$ and $D$ is obtained from $G$ by a…

Random matrices now play a role in many parts of computational mathematics. To advance these applications, it is desirable to have tools that are flexible, easy to use, and powerful. Over the last 25 years, researchers have developed a…

The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…

These lecture notes provide a comprehensive, self-contained introduction to the analysis of Wishart matrix moments. This study may act as an introduction to some particular aspects of random matrix theory, or as a self-contained exposition…

After we introduced biwreaths and biwreath-like objects in our previous paper, in the present one we define paired wreaths. In a paired wreath there is a monad $B$ and a comonad $F$ over the same 0-cell in a 2-category $\K$, so that $F$ is…

Networks are often studied using the eigenvalues of their adjacency matrix, a powerful mathematical tool with a wide range of applications. Since in real systems the exact graph structure is not known, researchers resort to random graphs to…

We identify a relationship between a certain family of random walks on Euclidean lattices and difference matrices over cyclic groups. We then use the techniques of Fourier analysis to estimate the return probabilities of these random walks,…

We investigate the Mal'tsev product $\mathcal{V} \circ \mathcal{W}$ of two varieties $\mathcal{V}$ and $\mathcal{W}$ of the same similarity type. Such a product is usually a quasivariety but not necessarily a variety. We give an equational…

In this short paper, we study some trace inequalities of the products of the matrices and the power of matrices by the use of elementary calculations.

Motivated by computational efficiency in algebraic automata theory here we define the cascade product of permutation groups as an external product, as a generic extension. It is the most general hierarchical product that uses arbitrary…

Recently, Bapat and Kurata [\textit{Linear Algebra Appl.}, 562(2019), 135-153] defined the Cartesian product of two square matrices $A$ and $B$ as $A\oslash B=A\otimes \J+\J\otimes B$, where $\J$ is the all one matrix of appropriate order…

We consider the problem of modelling noisy but highly symmetric shapes that can be viewed as hierarchies of whole-part relationships in which higher level objects are composed of transformed collections of lower level objects. To this end,…

A matrix-valued inner product was proposed before to construct orthonormal matrix-valued wavelets for matrix-valued signals. It introduces a weaker orthogonality for matrix-valued signals than the orthogonality of all components in a matrix…

We use the order complex corresponding to a symmetric matrix (defined by Giusti et al in 2015). In this note, we use it to define a class of models of random graphs, and show some surprising experimental results, showing sharp phase…

The characteristic polynomial and the spectrum of the lexicographic product of graphs $H[G]$, a specific instance of the generalized composition (also called $H$-join), are explicitly determined for arbitrary graphs $H$ and $G$, in terms of…

In this paper we review various strikingly parallel algebraic structures behind Hilbert schemes of points on surfaces and certain finite groups called the wreath products. We explain connections among Hilbert schemes, wreath products,…

A signed graph product is defined for a new product, and initially the unsigned graph product's Laplacian spectrum and signless Laplacian spectrum are found. Next, for the signed graph product, the adjacency spectrum, Laplacian spectrum,…

We study the vacuum matrix elements of products of parafields using graphical and combinatorial methods.

For two matrices $A$ and $B$, and large $n$, we show that most products of $n$ factors of $e^{A/n}$ and $n$ factors of $e^{B/n}$ are close to $e^{A + B}$. This extends the Lie-Trotter formula. The elementary proof is based on the relation…