Abstract
This article develops a rectangular version of Male’s theory of traffic probability, in which an algebra is equipped with a trace evaluated on arbitrary graphs whose edges are labeled by elements and whose vertices are subspaces. Using the language of traffic distributions, we characterize the asymptotic behavior of independent families of rectangular random matrices which are bi-permutation invariant. In the process, we take a tour of non-commutative probabilities and their random matrix models. Special attention is paid to rectangular random matrices with independent or exchangeable entries, including the existence and description of limiting ∗-distributions for a broad range of models.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
