  Graph independence (also known as $\epsilon$-independence or
$\lambda$-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.
