SearcharxivSearch

arXiv · 1911.07627

Asymptotic Freeness of Unitary Matrices in Tensor Product Spaces for Invariant States

Abstract

In this paper, we pursue our study of asymptotic properties of families of random matrices that have a tensor structure. In previous work, the first- and second-named authors provided conditions under which tensor products of unitary random matrices are asymptotically free with respect to the normalized trace. Here, we extend this result by proving that asymptotic freeness of tensor products of Haar unitary matrices holds with respect to a significantly larger class of states. Our result relies on invariance under the symmetric group, and therefore on traffic probability. As a byproduct, we explore two additional generalisations: (i) we state results of freeness in a context of general sequences of representations of the unitary group -- the fundamental representation being a particular case that corresponds to the classical asymptotic freeness result for Haar unitary matrices, and (ii) we consider actions of the symmetric group and the free group simultaneously and obtain a result of asymptotic freeness in this context as well.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Benoît Collins, Pierre Yves Gaudreau Lamarre, Camille Male. 2019-11-18. Asymptotic Freeness of Unitary Matrices in Tensor Product Spaces for Invariant States. https://doi.org/10.1142/s2010326322500526

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR