Random permutation matrix models for graph products
Graph independence (also known as \varepsilon -independence or \Lambda -independence) is a mixture of classical independence and free independence corresponding to graph products of groups or operator algebras. Using conjugation by certain random permutation matrices, we construct random matrix models for graph independence with amalgamation over the diagonal matrices. This yields a new probabilistic proof that graph products of sofic groups are sofic.
Authors
- Rolando de Santiago (ORCID: https://orcid.org/0000-0003-2353-9116)
- Srivatsav Kunnawalkam Elayavalli (ORCID: https://orcid.org/0000-0002-7928-2068)
- David Jekel (ORCID: https://orcid.org/0000-0002-8580-5064)
- Ian Charlesworth (ORCID: https://orcid.org/0000-0003-0546-2856)
- Ben Hayes (ORCID: https://orcid.org/0000-0001-9759-7672)
- Brent Nelson (ORCID: https://orcid.org/0000-0002-8388-3018)
Institutions
- University of Copenhagen (DK)
- University of California San Diego (US)
- University of Virginia (US)
- California State University, Long Beach (US)
- Cardiff Metropolitan University (GB)
- Michigan State University (US)
Publication Details
- Journal
- Documenta Mathematica
- Published
- 2025-07-14
- DOI
- https://doi.org/10.4171/dm/992
- Citations
- 1
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 4.09