Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Random permutation matrix models for graph products

Charlesworth, Ian, de Santiago, Rolando, Hayes, Ben, Jekel, David, Elayavalli, Srivatsav and Nelson, Brent 2025. Random permutation matrix models for graph products. Documenta Mathematica 30 (5) , pp. 1231-1269. 10.4171/dm/992

[thumbnail of 10.4171-dm-992 (1).pdf]
Preview
PDF - Published Version
Available under License Creative Commons Attribution.

Download (513kB) | Preview

Abstract

Graph independence (also known as ε-independence or Λ-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.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Schools > Mathematics
Publisher: European Mathematical Society
Date of First Compliant Deposit: 28 October 2024
Date of Acceptance: 14 October 2024
Last Modified: 29 Jul 2025 14:00
URI: https://orca.cardiff.ac.uk/id/eprint/173431

Actions (repository staff only)

Edit Item Edit Item

Downloads

Downloads per month over past year

View more statistics