A permutation model for free random variables and its classical analogue
From MaRDI portal
Publication:2270626
Abstract: In this paper, we generalize a permutation model for free random variables which was first proposed by Biane in cite{biane}. We also construct its classical probability analogue, by replacing the group of permutations with the group of subsets of a finite set endowed with the symmetric difference operation. These constructions provide new discrete approximations of the respective free and classical Wiener chaos. As a consequence, we obtain explicit examples of non random matrices which are asymptotically free or independent. The moments and the free (resp. classical) cumulants of the limiting distributions are expressed in terms of a special subset of (noncrossing) pairings. At the end of the paper we present some combinatorial applications of our results.
Recommendations
- scientific article; zbMATH DE number 2247293
- Cumulants for random matrices as convolutions on the symmetric group
- A combinatorial result on asymptotic independence relations for random matrices with non-commutative entries
- Asymptotic freeness of random permutation matrices with restricted cycle lengths
- Traffic distributions and independence: permutation invariant random matrices and the three notions of independence
Cited in
(4)- Curvature measures for nonlinear regression models using continuous designs with applications to optimal experimental design
- A noncrossing basis for noncommutative invariants of \(SL(2, \mathbb C)\)
- scientific article; zbMATH DE number 7297360 (Why is no real title available?)
- Permutation-invariance in Komlós type theorem for non-negative random variables
This page was built for publication: A permutation model for free random variables and its classical analogue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2270626)
