2019
DOI: 10.4153/cjm-2018-002-2
|View full text |Cite
|
Sign up to set email alerts
|

Freeness and The Partial Transposes of Wishart Random Matrices

Abstract: Abstract. We show that the partial transposes of complex Wishart random matrices are asymptotically free. We also investigate regimes where the number of blocks is xed but the size of the blocks increases. is gives a example where the partial transpose produces freeness at the operator level. Finally we investigate the case of real Wishart matrices.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
1

Relationship

3
3

Authors

Journals

citations
Cited by 14 publications
(26 citation statements)
references
References 10 publications
0
26
0
Order By: Relevance
“…If a random unitary matrix U is large enough, the unitarity constraints become so weak that after reshuffling the matrix U R shows statistical properties close to these of the Ginibre ensemble [45,49]-see also the recent rigorous results in Ref. [78]. Thus the corresponding positive matrix, U R (U R ) † , displays spectra in agreement with the Marčenko-Pastur law [48], P MP (x) = (2π ) −1 √ (4 − x)/x, derived to describe the spectral density of random Wishart matrices GG † .…”
Section: B Thermalization Of the Spectra Of Reshuffled And Partiallymentioning
confidence: 82%
“…If a random unitary matrix U is large enough, the unitarity constraints become so weak that after reshuffling the matrix U R shows statistical properties close to these of the Ginibre ensemble [45,49]-see also the recent rigorous results in Ref. [78]. Thus the corresponding positive matrix, U R (U R ) † , displays spectra in agreement with the Marčenko-Pastur law [48], P MP (x) = (2π ) −1 √ (4 − x)/x, derived to describe the spectral density of random Wishart matrices GG † .…”
Section: B Thermalization Of the Spectra Of Reshuffled And Partiallymentioning
confidence: 82%
“…Here we improve the results from [14], giving a general sufficient condition that implies asymptotic Boolean independence between the two matrices from above. In particular, we show the asymptotic Boolean independence from matrix transposes (result somehow analogous to [7]) and classes of matrix partial transposes (see also [8]). The last part of the paper, Section 5, presents a result concerning the asymptotic distribution of self-adjoint random matrices with identically distributed and Boolean independent entries.…”
Section: Introductionmentioning
confidence: 77%
“…To formulate the following consequence of the Theorem above, we need first to define (following [8]) the notion of partial m-transpose of a square matrix. Definition 4.4.…”
Section: Permutations Of Entries and Asymptotic Boolean Independencementioning
confidence: 99%
“…Lemma 4.1. Suppose that there exists some k ∈ [r] such that the sequence σ k,N N satisfies the following property: (16) lim…”
Section: Resultsmentioning
confidence: 99%
“…In the recent years one can notice the emergence of a small but growing body of literature addressing questions connected to permutations of entries of various classes of matrices. For example, partial transposes (see part 5.1 for a precise definition and more details) appear in connection to Quantum Information Theory in [13], [5], [12]; furthermore, distributions of partial transposes of Wishart random matrices are described in [4], [7], also in [16], [17]; very interesting examples of entry permutations and other linear transforms on matrix entries are studied in [2], [8]. One should also mention the groundbreaking work [1] on random entry permutations on Haar unitary random matrices.…”
Section: Introductionmentioning
confidence: 99%