相关论文: Wreath product of matrices

To apportion a complex matrix means to apply a similarity so that all entries of the resulting matrix have the same magnitude. We initiate the study of apportionment, both by unitary matrix similarity and general matrix similarity. There…

Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…

The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of…

We characterize the spectrum of the transition matrix for simple random walk on graphs consisting of a finite graph with a finite number of infinite Cayley trees attached. We show that there is a continuous spectrum identical to that for a…

In recent years the theory of border collision bifurcations has been developed for piecewise smooth maps that are continuous across the border, and has been successfully applied to explain nonsmooth bifurcation phenomena in physical…

Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product. Hypergraphs were introduced as a generalization…

Wildberger's construction enables us to obtain a hypergroup from a special graph via random walks. We will give a probability theoretic interpretation to products on the hypergroup. The hypergroup can be identified with a commutative…

We study the free product of rooted graphs and its various decompositions using quantum probabilistic methods. We show that the free product of rooted graphs is canonically associated with free independence, which completes the proof of the…

Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenvectors of matrices associated with graphs to study them. In this paper, we present a collection of $20$ topics in spectral graph theory,…

We study the spectra of mixed graphs about its Hermitian adjacency matrix of the second kind (i.e. N-matrix) introduced by Mohar [1]. We extend some results and define one new Hermitian adjacency matrix, and the entry corresponding to an…

A duality property for star products is exhibited. In view of it, known star-product schemes, like the Weyl-Wigner-Moyal formalism, the Husimi and the Glauber-Sudarshan maps are revisited and their dual partners elucidated. The tomographic…

We consider the Dyson hierarchical graph $\mathcal{G}$, that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter $\sigma \in (1/2, 1]$. Exploiting the deterministic recursivity through which…

The concept of the integrated adjacency matrix for mixed graphs was first introduced in [9], where its spectral properties were analyzed in relation to the structural characteristics of the mixed graph. Building upon this foundation, this…

We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…

Mark Haiman has reduced Macdonald positivity conjecture to a statement about geometry of the Hilbert scheme of points on the plane, and formulated a generalization of the conjectures where the symmetric group is replaced by the wreath…

Random matrix theory is a well-developed area of probability theory that has numerous connections with other areas of mathematics and its applications. Much of the literature in this area is concerned with matrices that possess many exact…

We consider certain scalar product of symmetric functions which is parameterized by a function $r$ and an integer $n$. One the one hand we have a fermionic representation of this scalar product. On the other hand we get a representation of…

Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical…

A mixed multigraph is obtained from an undirected multigraph by orienting a subset of its edges. In this paper, we study a new Hermitian matrix representation of mixed multigraphs, give an introduction to cospectral operations on mixed…

We construct generalized regular representations of the wreath product of a compact group with the infinite symmetric group. The characters of these representations are determined by probability measures on families of partitions called the…