Random unistochastic matrices

From MaRDI portal



Abstract: An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U(N) (or O(N), respectively). An ensemble of symmetric unistochastic matrices is obtained with use of unitary symmetric matrices pertaining to the circular orthogonal ensemble. We study the distribution of complex eigenvalues of bistochastic, unistochastic and ortostochastic matrices in the complex plane. We compute averages (entropy, traces) over the ensembles of unistochastic matrices and present inequalities concerning the entropies of products of bistochastic matrices.


A square matrix with nonnegative entries is called stochastic if each of its rows sum one; a stochastic matrix is called bistochastic (also called doubly stochastic) if each column sums one. Given a unitary matrix \(U\), the matrix \([| U_{ij}| ^2]\) is bistochastic; matrices which arise in this way are called unistochastic. The authors analyze the structure of sets of such matrices. They also study the support of their spectra, and they consider several particular ensembles (sets together with a probability measure) of random unistochastic matrices. A notion of entropy for bistochastic matrices is defined and analyzed.




Cited in
(38)








This page was built for publication: Random unistochastic matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4443908)