Abstract: We introduce a new matrix product, that we call the wreath product of matrices. The name is inspired by the analogous product for graphs, and the following important correspondence is proven: the wreath product of the adjacency matrices of two graphs provides the adjacency matrix of the wreath product of the graphs. This correspondence is exploited in order to study the spectral properties of the famous Lamplighter random walk: the spectrum is explicitly determined for the "Walk or switch" model on a complete graph of any size, with two lamp colors. The investigation of the spectrum of the matrix wreath product is actually developed for the more general case where the second factor is a circulant matrix. Finally, an application to the study of generalized Sylvester matrix equations is treated.
Recommendations
- Spectrum, distance spectrum, and Wiener index of wreath products of complete graphs
- Wreath product of a complete graph with a cyclic graph: topological indices and spectrum
- scientific article; zbMATH DE number 3893251
- Generalized wreath products
- The spectra of lamplighter groups and Cayley machines.
Cites work
- scientific article; zbMATH DE number 3650737 (Why is no real title available?)
- scientific article; zbMATH DE number 6315655 (Why is no real title available?)
- A NOTE ON THE NORMS OF TRANSITION OPERATORS ON LAMPLIGHTER GRAPHS AND GROUPS
- Associative products of graphs
- Crested products of Markov chains
- Eigenvectors of block circulant and alternating circulant matrices
- Generalized crested products of Markov chains
- Generalized wreath products
- Generalized wreath products of graphs and groups
- Graph multiplication
- Handbook of product graphs
- Harmonic analysis of finite lamplighter random walks
- Harmonic analysis on a finite homogeneous space
- Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
- Markov chains on orthogonal block structures
- Representation theory of wreath products of finite groups
- Spectral computations on lamplighter groups and Diestel-Leader graphs
- Spectrum, distance spectrum, and Wiener index of wreath products of complete graphs
- The composition of graphs
- The lumpability property for a family of Markov chains on poset block structures
Cited in
(9)- Wreath product of a complete graph with a cyclic graph: topological indices and spectrum
- On the spectra of wreath products of circulant graphs
- Distance-balanced graphs and travelling salesman problems
- Total distance, Wiener index and opportunity index in wreath products of star graphs
- Topological indices of the wreath product of graphs
- Spectrum, distance spectrum, and Wiener index of wreath products of complete graphs
- Permutational powers of a graph
- Lifting wreath product extensions
- Some degree and distance-based invariants of wreath products of graphs
This page was built for publication: Wreath product of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344910)