Matrix models for -free independence
From MaRDI portal
Abstract: We investigate tensor products of random matrices, and show that independence of entries leads asymptotically to -free independence, a mixture of classical and free independence studied by M{l}otkowski and by Speicher and Wysocza'nski. The particular arising is prescribed by the tensor product structure chosen, and conversely, we show that with suitable choices an arbitrary may be realized in this way. As a result we obtain a new proof that -embeddability is preserved under graph products of von Neumann algebras, along with an explicit recipe for constructing matrix models.
Recommendations
Cites work
- scientific article; zbMATH DE number 1890851 (Why is no real title available?)
- A linearization of Connes' embedding problem
- Connes embeddability of graph products
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- Graph groups, coherence, and three-manifolds
- Graph products of operator algebras
- Hyperlinear and Sofic Groups: A Brief Guide
- Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
- Introduction to sofic and hyperlinear groups and Connes' embedding conjecture. With an appendix by Vladimir Pestov
- Isomorphisms of Graph Groups
- Mixtures of classical and free independence
- Quantum groups with partial commutation relations
- Random quantum channels. I: Graphical calculus and the Bell state phenomenon
- Representations of symmetric groups and free probability
- Subgroups of graph groups
- Λ-FREE PROBABILITY
This page was built for publication: Matrix models for \(\varepsilon\)-free independence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828626)