English

Rigid structures in the universal enveloping traffic space

Operator Algebras 2020-11-12 v1 Combinatorics Probability

Abstract

For any tracial non-commutative probability space (A,φ)(\mathcal{A}, \varphi), C\'{e}bron, Dahlqvist, and Male showed that one can always construct an enveloping traffic space (G(A),τφ)(\mathcal{G}(\mathcal{A}), \tau_\varphi) that extends the trace. This construction provides a universal object that allows one to appeal to the traffic probability framework in generic situations, prioritizing an understanding of its structure. In this article, we prove that (G(A),τφ)(\mathcal{G}(\mathcal{A}), \tau_\varphi) admits a canonical free product decomposition AAΘ(G(A))\mathcal{A} * \mathcal{A}^\intercal * \Theta(\mathcal{G}(\mathcal{A})). In particular, A\mathcal{A}^\intercal is an anti-isomorphic copy of A\mathcal{A}, and Θ(G(A))\Theta(\mathcal{G}(\mathcal{A})) is, up to degeneracy, a commutative algebra generated by Gaussian random variables with a covariance structure diagonalized by the graph operations. If (A,φ)(\mathcal{A}, \varphi) itself is a free product, then we describe how this additional structure lifts into (G(A),τφ)(\mathcal{G}(\mathcal{A}), \tau_\varphi). Here, we find a connection between free independence and classical independence opposite the usual direction. Up to degeneracy, we further show that (G(A),τφ)(\mathcal{G}(\mathcal{A}), \tau_\varphi) is spanned by tree-like graph operations. Finally, we apply our results to the study of large (possibly dependent) random matrices. Our analysis relies on the combinatorics of cactus graphs and the resulting cactus-cumulant correspondence.

Keywords

Cite

@article{arxiv.2011.05472,
  title  = {Rigid structures in the universal enveloping traffic space},
  author = {Benson Au and Camille Male},
  journal= {arXiv preprint arXiv:2011.05472},
  year   = {2020}
}

Comments

54 pages, 16 figures

R2 v1 2026-06-23T20:03:59.015Z