相关论文: Wreath product of matrices

The number of walks from one vertex to another in a finite graph can be counted by the adjacency matrix. In this paper, we prove two theorems that connect the graph Laplacian with two types of walks in a graph. By defining two types of…

Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum. Constructions of cospectral graphs help us…

The newly introduced neighborhood matrix extends the power of adjacency and distance matrices to describe the topology of graphs. The adjacency matrix enumerates which pairs of vertices share an edge and it may be summarized by the degree…

For a finitely generated regular wreath product, the metric is known, but its computation can be an NP-complete problem. Also, it is not known for the nonregular case. In this article, a metric estimate is defined for regular wreath…

We consider algorithms with access to an unknown matrix $M\in\mathbb{F}^{n \times d}$ via matrix-vector products, namely, the algorithm chooses vectors $\mathbf{v}^1, \ldots, \mathbf{v}^q$, and observes $M\mathbf{v}^1,\ldots,…

Certain foams and relations on them are introduced to interpret functors and natural transformations in categories of representations of iterated wreath products of cyclic groups of order two. We also explain how patched surfaces with…

In this paper we present new results for the combinatorics of web diagrams and web worlds. These are discrete objects that arise in the physics of calculating scattering amplitudes in non-abelian gauge theories. Web-colouring and web-mixing…

A dot-product representation of a graph is a mapping of its vertices to vectors of length $k$ so that vertices are adjacent if and only if the inner product (a.k.a. dot product) of their corresponding vertices exceeds some threshold.…

The main contribution of this work is a new type of graph product, which we call the {\it zig-zag product}. Taking a product of a large graph with a small graph, the resulting graph inherits (roughly) its size from the large one, its degree…

The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…

Let $G$ be a simple graph, $A(G)$ its adjacency matrix, and $D(G)$ its diagonal degree matrix. In 2022, \citeauthor{Wang2020} (\cite{Wang2020}) defined the family of matrices $L_\alpha$ as the convex linear combination: \[ L_\alpha(G) =…

In this paper, we introduce and initiate the study of quandle products of groups, a family of groups that includes graph products of groups, cactus groups, wreath products, and the recently introduced trickle groups. Our approach is…

Products and sums of random matrices have seen a rapid development in the past decade due to various analytical techniques available. Two of these are the harmonic analysis approach and the concept of polynomial ensembles. Very recently, it…

This paper introduces a novel Laplacian matrix aiming to enable the construction of spectral convolutional networks and to extend the signal processing applications for directed graphs. Our proposal is inspired by a Haar-like transformation…

In this article we examine the adjacency and Laplacian matrices and their eigenvalues and energies of the general product (non-complete extended $p$-sum, or NEPS) of signed graphs. We express the adjacency matrix of the product in terms of…

There has been significant research dedicated towards computing the crossing numbers of families of graphs resulting from the Cartesian products of small graphs with arbitrarily large paths, cycles and stars. For graphs with four or fewer…

We introduce a new construction of matrix wreath products of algebras that is similar to wreath products of groups. We then use it to prove embedding theorems for Jacobson radical, nil, and primitive algebras. In \S\ref{Section6}, we…

Graph inference plays an essential role in machine learning, pattern recognition, and classification. Signal processing based approaches in literature generally assume some variational property of the observed data on the graph. We make a…

We consider products of $n$ random Hermitian matrices which generalize the one-matrix model and show its relation to Hurwitz numbers which count ramified coverings of certain type. Namely, these Hurwitz numbers count $2k$-fold ramified…

For fixed $m > 1$, we study the product of $m$ independent $N \times N$ elliptic random matrices as $N$ tends to infinity. Our main result shows that the empirical spectral distribution of the product converges, with probability $1$, to the…