Free convolution explained

Free convolution is the free probability analog of the classical notion of convolution of probability measures. Due to the non-commutative nature of free probability theory, one has to talk separately about additive and multiplicative free convolution, which arise from addition and multiplication of free random variables (see below; in the classical case, what would be the analog of free multiplicative convolution can be reduced to additive convolution by passing to logarithms of random variables). These operations have some interpretations in terms of empirical spectral measures of random matrices.[1]

The notion of free convolution was introduced by Dan-Virgil Voiculescu.[2] [3]

Free additive convolution

Let

\mu

and

\nu

be two probability measures on the real line, and assume that

X

is a random variable in a non commutative probability space with law

\mu

and

Y

is a random variable in the same non commutative probability space with law

\nu

. Assume finally that

X

and

Y

are freely independent. Then the free additive convolution

\mu\boxplus\nu

is the law of

X+Y

. Random matrices interpretation: if

A

and

B

are some independent

n

by

n

Hermitian (resp. real symmetric) random matrices such that at least one of them is invariant, in law, under conjugation by any unitary (resp. orthogonal) matrix and such that the empirical spectral measures of

A

and

B

tend respectively to

\mu

and

\nu

as

n

tends to infinity, then the empirical spectral measure of

A+B

tends to

\mu\boxplus\nu

.[4]

In many cases, it is possible to compute the probability measure

\mu\boxplus\nu

explicitly by using complex-analytic techniques and the R-transform of the measures

\mu

and

\nu

.

Rectangular free additive convolution

The rectangular free additive convolution (with ratio

c

)

\boxplusc

has also been defined in the non commutative probability framework by Benaych-Georges[5] and admits the following random matrices interpretation. For

c\in[0,1]

, for

A

and

B

are some independent

n

by

p

complex (resp. real) random matrices such that at least one of them is invariant, in law, under multiplication on the left and on the right by any unitary (resp. orthogonal) matrix and such that the empirical singular values distribution of

A

and

B

tend respectively to

\mu

and

\nu

as

n

and

p

tend to infinity in such a way that

n/p

tends to

c

, then the empirical singular values distribution of

A+B

tends to

\mu\boxplusc\nu

.[6]

In many cases, it is possible to compute the probability measure

\mu\boxplusc\nu

explicitly by using complex-analytic techniques and the rectangular R-transform with ratio

c

of the measures

\mu

and

\nu

.

Free multiplicative convolution

Let

\mu

and

\nu

be two probability measures on the interval

[0,+infty)

, and assume that

X

is a random variable in a non commutative probability space with law

\mu

and

Y

is a random variable in the same non commutative probability space with law

\nu

. Assume finally that

X

and

Y

are freely independent. Then the free multiplicative convolution

\mu\boxtimes\nu

is the law of

X1/2YX1/2

(or, equivalently, the law of

Y1/2XY1/2

. Random matrices interpretation: if

A

and

B

are some independent

n

by

n

non negative Hermitian (resp. real symmetric) random matrices such that at least one of them is invariant, in law, under conjugation by any unitary (resp. orthogonal) matrix and such that the empirical spectral measures of

A

and

B

tend respectively to

\mu

and

\nu

as

n

tends to infinity, then the empirical spectral measure of

AB

tends to

\mu\boxtimes\nu

.[7]

A similar definition can be made in the case of laws

\mu,\nu

supported on the unit circle

\{z:|z|=1\}

, with an orthogonal or unitary random matrices interpretation.

Explicit computations of multiplicative free convolution can be carried out using complex-analytic techniques and the S-transform.

Applications of free convolution

Through its applications to random matrices, free convolution has some strong connections with other works on G-estimation of Girko.

The applications in wireless communications, finance and biology have provided a useful framework when the number of observations is of the same order as the dimensions of the system.

See also

References

External links

Notes and References

  1. Anderson, G.W.; Guionnet, A.; Zeitouni, O. (2010). An introduction to random matrices. Cambridge: Cambridge University Press. .
  2. Voiculescu, D., Addition of certain non-commuting random variables, J. Funct. Anal. 66 (1986), 323–346
  3. Voiculescu, D., Multiplication of certain noncommuting random variables, J. Operator Theory 18 (1987), 2223–2235
  4. Anderson, G.W.; Guionnet, A.; Zeitouni, O. (2010). An introduction to random matrices. Cambridge: Cambridge University Press. .
  5. Benaych-Georges, F., Rectangular random matrices, related convolution, Probab. Theory Related Fields Vol. 144, no. 3 (2009) 471-515.
  6. Benaych-Georges, F., Rectangular random matrices, related convolution, Probab. Theory Related Fields Vol. 144, no. 3 (2009) 471-515.
  7. Anderson, G.W.; Guionnet, A.; Zeitouni, O. (2010). An introduction to random matrices. Cambridge: Cambridge University Press. .

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Free convolution".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.