Random permutation matrix models for graph products

Abstract

Graph independence (also known as $\hat{I}\mu$-independence or $\hat{I}»$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and 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 probabilist,ic proof that graph products of sofic groups are sofic.

29 pages, multiple figures. Minor replacements, correcting typos etc. arXiv admin note: substantial text overlap with arXiv:2305.19463