Matrix models for $\varvec{\varepsilon }$-free independence
Open Access
- 22 February 2021
- journal article
- research article
- Published by Springer Nature in Archiv der Mathematik
- Vol. 116 (5) , 585-600
Abstract
We investigate tensor products of random matrices, and show that independence of entries leads asymptotically to $$\varepsilon $$ -free independence, a mixture of classical and free independence studied by Młotkowski and by Speicher and Wysoczański. The particular $$\varepsilon $$ arising is prescribed by the tensor product structure chosen, and conversely, we show that with suitable choices an arbitrary $$\varepsilon $$ may be realized in this way. As a result, we obtain a new proof that $$\mathcal {R}^\omega $$ -embeddability is preserved under graph products of von Neumann algebras, along with an explicit recipe for constructing matrix models.
Keywords
All Related Versions
Funding Information
- Division of Mathematical Sciences (1803557)
- Japan Society for the Promotion of Science (17K18734, 17H04823)
- Japan Society for the Promotion of Science (15KK0162)
- Agence Nationale de la Recherche (14-CE25-0003)
This publication has 9 references indexed in Scilit:
- On graph products of multipliers and the Haagerup property for C*-dynamical systemsErgodic Theory and Dynamical Systems, 2020
- Many-body systems with random spatially local interactionsPhysical Review B, 2019
- Connes embeddability of graph productsInfinite Dimensional Analysis, Quantum Probability and Related Topics, 2016
- Introduction to Sofic and Hyperlinear Groups and Connes' Embedding Conjecture2015
- Random Quantum Channels I: Graphical Calculus and the Bell State PhenomenonCommunications in Mathematical Physics, 2010
- Hyperlinear and Sofic Groups: A Brief GuideThe Bulletin of Symbolic Logic, 2008
- Subgroups of graph groupsJournal of Algebra, 1987
- Graph groups, coherence, and three-manifoldsJournal of Algebra, 1987
- Covering edges by cliques with regard to keyword conflicts and intersection graphsCommunications of the ACM, 1978