[Paper Review] Traffics distributions and independence: the permutation invariant matrices and the notions of independence

Camille Male|arXiv (Cornell University)|Nov 20, 2011

Random Matrices and Applications3 citations

TL;DR

This paper introduces traffic probability as an extension of free probability, unifying tensor, free, and Boolean independence through permutation-invariant random matrices. It establishes traffic independence as an asymptotic rule that enables computation of limiting joint distributions, leading to a central limit theorem interpolating across classical, free, and Boolean limits.

ABSTRACT

Voiculescu's notion of asymptotic free independence is known for a large class of random matrices including independent unitary invariant matrices. This notion is extended for independent random matrices invariant in law by conjugation by permutation matrices. This fact leads naturally to an extension of free probability, formalized under the notions of traffic probability. We first establish this construction for random matrices. We define the traffic distribution of random matrices, which is richer than the *-distribution of free probability. The knowledge of the individual traffic distributions of independent permutation invariant families of matrices is sufficient to compute the limiting distribution of the join family. Under a factorization assumption, we call traffic independence the asymptotic rule that plays the role of independence with respect to traffic distributions. Wigner matrices, Haar unitary matrices and uniform permutation matrices converge in traffic distributions, a fact which yields new results on the limiting *-distributions of several matrices we can construct from them. Then we define the abstract traffic spaces as non commutative probability spaces with more structure. We prove that at an algebraic level, traffic independence in some sense unifies the three canonical notions of tensor, free and Boolean independence. A central limiting theorem is stated in this context, interpolating between the tensor, free and Boolean central limit theorems.

Motivation & Objective

• To extend Voiculescu's notion of asymptotic free independence to random matrices invariant under conjugation by permutation matrices.
• To define traffic distributions as a richer structure than *-distributions in free probability.
• To formalize traffic independence as the asymptotic rule governing limiting joint distributions of independent permutation-invariant matrix families.
• To unify the three canonical notions of independence—tensor, free, and Boolean—within a single algebraic framework of abstract traffic spaces.
• To establish a central limit theorem in traffic probability that interpolates between tensor, free, and Boolean central limit theorems.

Proposed method

• Define traffic distributions for random matrices as a generalization of *-distributions, capturing more structural information.
• Introduce permutation invariance under conjugation as a key symmetry condition enabling the extension of asymptotic independence.
• Establish that Wigner, Haar unitary, and uniform permutation matrices converge in traffic distribution, enabling new results on limiting *-distributions.
• Construct abstract traffic spaces as non-commutative probability spaces with enhanced algebraic structure to formalize traffic independence.
• Prove that traffic independence algebraically unifies tensor, free, and Boolean independence through a universal algebraic framework.
• Derive a central limit theorem in traffic probability that interpolates between the classical, free, and Boolean central limit theorems.

Experimental results

Research questions

• RQ1 How can asymptotic independence in random matrix theory be extended beyond free independence to include permutation-invariant matrix ensembles?
• RQ2 What is the role of permutation invariance in defining a richer notion of distribution than *-distribution in free probability?
• RQ3 Can traffic independence unify the three canonical notions of independence—tensor, free, and Boolean—at the algebraic level?
• RQ4 How do classical random matrix ensembles like Wigner, Haar unitary, and uniform permutation matrices behave in the traffic distribution framework?
• RQ5 What is the form of a central limit theorem in traffic probability that interpolates across the classical, free, and Boolean cases?

Key findings

• Traffic distributions provide a richer structure than *-distributions, capturing more information about the joint asymptotic behavior of random matrices.
• Asymptotic traffic independence allows the limiting joint distribution of independent permutation-invariant matrix families to be computed from their individual traffic distributions.
• Wigner matrices, Haar unitary matrices, and uniform permutation matrices all converge in traffic distribution, enabling new results on their limiting *-distributions.
• Traffic independence algebraically unifies tensor, free, and Boolean independence within the framework of abstract traffic spaces.
• A central limit theorem in traffic probability interpolates between the classical, free, and Boolean central limit theorems, generalizing all three in a single framework.