REVIEW 2 cited by
Random permutation matrix models for graph products
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
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.
Forward citations
Cited by 2 Pith papers
-
Universal C$^{\ast}$-Algebras from Graph Products: Structure and Applications
A new family of ambient C*-algebras around graph products yields universal properties, nuclearity/exactness characterizations, a maximal ideal, and new simplicity and trace-uniqueness criteria for graph product C*-algebras.
-
Khintchine inequalities, trace monoids and Tur\'an-type problems
For sums of G-independent semicircle variables, the operator norm is bounded by 2√ω(G) and is exactly the spectral radius of the Cayley graph of the associated trace monoid.
Discussion (0). Sign in to comment.