![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
Asymptotic Freeness of Random Permutation Matrices from Gaussian Matrices
Subscribe/Renew Journal
It is shown that an independent family of uniformly distributed random permutation matrices is asymptotically ∗-free from an independent family of square complex Gaussian matrices and from an independent family of complexWishart matrices, and that in both cases the convergence in ∗-distribution actually holds almost surely.
An immediate consequence is that, if the rows of a GUE matrix are randomly permuted, then the resulting (non self-adjoint) random matrix has a ∗-distribution which is asymptotically circular; similarly, a random permutation of the rows of a complex Wishart matrix results in a random matrix which is asymptotically ∗-distributed like an R-diagonal element from free probability theory.
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 174
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0