Properties of Free Multiplicative Convolution Hong Chang Ji Korea - - PowerPoint PPT Presentation

properties of free multiplicative convolution
SMART_READER_LITE
LIVE PREVIEW

Properties of Free Multiplicative Convolution Hong Chang Ji Korea - - PowerPoint PPT Presentation

Properties of Free Multiplicative Convolution Hong Chang Ji Korea Advanced Institute of Science and Technology (KAIST) Random Matrices and Related Topics May 6 - 10, 2019 Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 1 /


slide-1
SLIDE 1

Properties of Free Multiplicative Convolution

Hong Chang Ji

Korea Advanced Institute of Science and Technology (KAIST)

Random Matrices and Related Topics May 6 - 10, 2019

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 1 / 34

slide-2
SLIDE 2

Introduction

Wishart ensemble

Suppose that we have sample N independent random vectors {x1, · · · , xN} from N-dimensional complex standard Gaussian distribution. Then their sample covariance matrix is defined by XX ∗, where X = (xij)1≤i,j≤N = (x1, · · · , xN). X and XX ∗ are known as (complex) Ginibre and Wishart ensemble.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 2 / 34

slide-3
SLIDE 3

Introduction

Marˇ cenko-Pastur law

The empirical distribution of eigenvalues of N−1XX ∗ converges to the Marˇ cenko-Pastur distribution µMP:

1 2 3 4 5 0.0 0.5 1.0 1.5 2.0

Figure: Histogram of eigenvalues of N−1XX ∗ with N = 5000 and density

1 2π

  • (4−x)

x

  • f Marˇ

cenko-Pastur distribution.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 3 / 34

slide-4
SLIDE 4

Introduction

Sample covariance matrix with general population

In some occasions, we wish to consider the case in which the law of x is non-standard Gaussian, so that the variables are dependent. Thus we take yi := Dxi where D is another (N × N) matrix, called population matrix. In this case, the sample covariance matrix becomes YY ∗ = (y1, · · · , yN)(y1, · · · , yN)T = DXX ∗D∗, referred as non-white Wishart ensemble.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 4 / 34

slide-5
SLIDE 5

Introduction

deformed Marˇ cenko-Pastur law

If the e.s.d. of D∗D converges to a probability measure ν, then that

  • f DXX ∗D∗ also converges(Marˇ

cenko and Pastur, 1967 [8]). The limiting measure was characterized by an integral equation satisfied by its Stieltjes transform.

2 4 6 8 10 0.0 0.5 1.0 1.5 2.0 2.5

Figure: Eigenvalues of DXX ∗D∗ where e.s.d. of DD∗ converges to the arcsine distribution µAS(dx) := 1

π 1

x(4−x)dx

The limit is “free multiplicative convolution” of ν and µMP.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 5 / 34

slide-6
SLIDE 6

Free convolutions

Stieltjes transform and M-function

Definition 1 For a probability measure µ on R+ := [0, ∞), we define its Stieltjes transform and M-function by, for z ∈ C \ R+, mµ(z) :=

  • 1

x − z dµ(x), and Mµ(z) = 1 −

  • x

x − z dµ(x) −1 . Remark Mµ(z) = 1 − (zmµ(z) + 1)−1 mµ, Mµ : C \ R+ → C \ R+ are analytic. Mµ : (−∞, 0) ∼ − → (−∞, −µ(0)/(1 − µ(0))) is increasing. M−1

µ

is analytic in a neighborhood of (−∞, −µ(0)/(1 − µ(0))).

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 6 / 34

slide-7
SLIDE 7

Free convolutions

Free multiplicative convolution

Definition 2 For two probability measures µ and ν on [0, ∞), both not δ0, µ ⊠ ν is the unique probability measure satisfying M−1

µ⊠ν(z) = 1

z M−1

µ (z)M−1 ν (z)

in a neighborhood of (−∞, −C). Remark If X and Y are free random variables with distributions µ and ν, then µ ⊠ ν is the distribution of √ XY √ X (or √ Y X √ Y ).

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 7 / 34

slide-8
SLIDE 8

Free convolutions

Free additive convolution

Definition 3 For two probability measures µ and ν on R, µ ⊞ ν is the unique probability measure satisfying F −1

µ⊞ν(z) = F −1 µ (z) + F −1 ν (z) − z

in a neighborhood of (iM, i∞), where Fµ(z) := −1/mµ(z). Remark If X and Y are free random variables with distributions µ and ν, then µ ⊞ ν is the distribution of X + Y . As X and Y are noncommutative, log(XY ) = log X + log Y and eX+Y = eXeY are no longer true.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 8 / 34

slide-9
SLIDE 9

Free convolutions

Connection to random matrices

UN: (N × N)- Haar distributed random unitary matrix. CN = diag(c(N)

1

, · · · , c(N)

N ), DN = diag(d(N) 1

, · · · , d(N)

N

) such that 1 N

N

  • i=1

δc(N)

i

→ µ and 1 N

N

  • i=1

δd(N)

i

→ ν, as N → ∞. (λ(N)

1

, · · · , λ(N)

N ): eigenvalues of CN + UNDNU∗ N,

(γ(N)

1

, · · · , γ(N)

N ): those of √CNUNDNU∗ N

√CN (for CN, DN ≥ 0). Theorem (Voiculescu, 1998 [9]) 1 N

N

  • i=1

δλ(N)

i

→ µ ⊞ ν and 1 N

N

  • i=1

δγ(N)

i

→ µ ⊠ ν. We may replace UNDNU∗

N with Wishart ensemble and ν with µMP.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 9 / 34

slide-10
SLIDE 10

Free convolutions

Marˇ cenko-Pastur distribution revisited

µMP = lim

n→∞((n − 1)δ0/n + δ1/n)⊞n is also known as free Poisson law.

In general for any a ≥ 1, ((n − a) δ0/n + aδ1/n)⊞n converges to µ(a)

MP(dx) :=

1 2πx

  • 4a − (x − (a + 1))2dx.

The measure µ(a)

MP’s are also the limiting e.s.d. of the general sample

covariance N−1XX ∗, where X is (N × M) random matrix whose entries are i.i.d. and M/N → a. In fact, µ(a)

MP are also ⊠-infinitely divisible, so that the common

properties of µ(a)

MP are “desirable” in terms of the operation ⊠.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 10 / 34

slide-11
SLIDE 11

Free convolutions

Marˇ cenko-Pastur distribution revisited

Examples of “desirable” properties are.. Having density, which is analytic in the bulk of spectrum. The density being bounded by 1/x. The density decaying as square root at the edges.

 ]= 1 2 3 4 5 6 7 0.05 0.10 0.15 0.20 0.25

a=1 a=2 a=3

Figure: Densities of µ(a)

MP

These properties of µ(a)

MP hold even for convolution of two measures,

under proper assumptions.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 11 / 34

slide-12
SLIDE 12

Main results

Regularity(Lebesgue decomposition) of free convolution

Let µ = 1

2δ0 + 1 2δ2. Then µ ⊠ µ can be explicitly calculated as

1 2δ0 + 1 2π

  • x(4 − x)

✶(0,4)(x)dx.

1 2 3 4 0.1 0.2 0.3 0.4 0.5 0.6 0.7

Figure: Nonzero eigenvalues of (5 · 103) matrix √ CUDU∗√ C, where {ci, di} are i.i.d. with law µ and U is independent of C and D.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 12 / 34

slide-13
SLIDE 13

Main results

Known results for free additive convolution: Lebesgue decomposition

Theorem (Belinschi, 2008 [4]) Let µ and ν be Borel probability measures on R, both not a point mass. (i) (µ ⊞ ν)({a}) > 0 if and only if there exist b, c ∈ R with a = b + c and µ({b}) + ν({c}) > 1. In this case, (µ ⊞ ν)({a}) = µ({b}) + ν({c}) − 1. (ii) (µ ⊞ ν)sc ≡ 0. (iii)

d dx (µ ⊞ ν)ac(x) is analytic whenever positive and finite.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 13 / 34

slide-14
SLIDE 14

Main results

Lebesgue decomposition

Theorem 1 (J., 2019 [7]) Let µ and ν be Borel probability measures on R+, both not a point mass. (i*) For c > 0, (µ ⊠ ν)({c}) > 0 if and only if there exist u, v ∈ (0, ∞) with uv = c and µ({u}) + ν({v}) > 1. In this case, (µ ⊠ ν)({c}) = µ({u}) + ν({v}) − 1. (ii*) (µ ⊠ ν)({0}) = max(µ({0}), ν({0})). (iii) (µ ⊠ ν)sc ≡ 0. (iv)

d(µ⊠ν)ac(x) dx

is analytic whenever positive and finite. *First two statements were proved in Belinschi, 2003 [3].

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 14 / 34

slide-15
SLIDE 15

Main results

Boundedness of the density

Letting µ = (1 − p)δ0 + pδ1/p, we find that µ ⊠ µ almost have an atom at p−2 if p = 1/2. Figures below show what happens if p < 1/2.

1 2 3 4 0.0 0.2 0.4 0.6 0.8 1.0

Figure: Density of (µ ⊠ µ)ac where µ = 0.51δ0 + 0.49δ1/0.49.

1 2 3 4 5 0.0 0.1 0.2 0.3 0.4 0.5 0.6 0.7

Figure: Density of (µ ⊠ µ)ac where µ = 0.55δ0 + 0.45δ1/0.45.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 15 / 34

slide-16
SLIDE 16

Main results

Known results for free additive convolution: Boundedness of the density

Theorem (Belinschi, 2013 [5]) Let µ and ν be Borel probability measures on R, both not a point mass. If Fµ and Fν are continuous at infinity and µ({b}) + ν({c}) < 1 for all b, c ∈ R, then µ ⊞ ν = (µ ⊞ ν)ac and the density is bounded and continuous. Remark The density of µMP diverges as x−1/2 around x, thus we need different statement to cover µMP.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 16 / 34

slide-17
SLIDE 17

Main results

Boundedness of the density

Theorem 2 (J., 2019 [7]) Let µ and ν be probability measures on R+ such that Mµ and Mν are continuous at 0 and ∞. Further assume that µ({a}) + ν({b}) < 1 for all a, b ∈ (0, ∞). Then the density of (µ ⊠ ν)ac is continuous and uniformly O(x−1) on (0, ∞). Remark By Theorem 1 (i), µ ⊠ ν can have point mass at 0 under the assumptions

  • f Theorem 2.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 17 / 34

slide-18
SLIDE 18

Main results

Square root behavior at the edges

U: Haar unitary matrix, X1, X2: Ginibre ensembles

2 4 6 8 10 0.0 0.5 1.0 1.5 2.0 2.5

Figure: Limiting e.s.d. µMP ⊠ µAS

  • f (I + U)X1X ∗

1 (I + U∗).

1 2 3 4 5 6 7 1 2 3 4

Figure: Limiting e.s.d. µMP ⊠ µMP

  • f X2X1X ∗

1 X ∗ 2 .

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 18 / 34

slide-19
SLIDE 19

Main results

Square root behavior at the edges

U: Haar unitary matrix, X1, X2: Ginibre ensembles

2 4 6 8 10 0.0 0.5 1.0 1.5 2.0 2.5

Figure: Limiting e.s.d. µMP ⊠ µAS

  • f (I + U)X1X ∗

1 (I + U∗).

1 2 3 4 5 6 7 1 2 3 4

Figure: Limiting e.s.d. µMP ⊠ µMP

  • f X2X1X ∗

1 X ∗ 2 .

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 18 / 34

slide-20
SLIDE 20

Main results

Square root behavior at the edges

U: Haar unitary matrix, X1, X2: Ginibre ensembles

10.2 10.4 10.6 10.8 11.0 0.000 0.002 0.004 0.006 0.008

Figure: Limiting e.s.d. µMP ⊠ µAS

  • f (I + U)X1X ∗

1 (I + U∗).

6.2 6.4 6.6 6.8 7.0 0.000 0.005 0.010 0.015

Figure: Limiting e.s.d. µMP ⊠ µMP

  • f X2X1X ∗

1 X ∗ 2 .

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 18 / 34

slide-21
SLIDE 21

Main results

Known results for free additive convolution: Square root behavior

Assumption 1 Let µ and ν be Borel probability measures on R satisfying the following: (i) They have densities; dµ(x) = ρµ(x)dx, dν(x) = ρν(x)dx. (ii) supp ρµ = [E µ

−, E µ +], supp ρν = [E ν −, E ν +].

(iii) The measures are Jacobi; there exist −1 < tµ

±, tν ± < 1 and a constant

C > 1 such that C −1 ≤ ρµ(x) (x − E µ

−)tµ

−(E µ

+ − x)tµ

+ ≤ C,

for a.e. x ∈ [E µ

−, E µ +],

and the same bound holds for ν.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 19 / 34

slide-22
SLIDE 22

Main results

Known results for free additive convolution: Square root behavior

Theorem (Bao, Erd˝

  • s and Schnelli, 2018 [2])

Under Assumption 1, there exist E− < E+ and γ+, γ− > 0 such that {E ∈ R : ρ(x) > 0} = (E−, E+) so that supp(µ ⊞ ν) = [E−, E+], lim

xցE−

ρ(x)

  • x − E−

= γ−, lim

xրE+

ρ(x)

  • E+ − x

= γ+, where ρ(x) is the continuous density of µ ⊞ ν.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 20 / 34

slide-23
SLIDE 23

Main results

Square root behavior at the edges

Theorem 3 (J. 2019 [7]) Let µ and ν be probability measures on R+ satisfying Assumption 1 and E µ

−, E ν − > 0. Then there exist 0 < E− < E+ and γ+, γ− > 0 such that

{E ∈ R : ρ(x) > 0} = (E−, E+) so that supp(µ ⊠ ν) = [E−, E+], lim

xցE−

ρ(x)

  • x − E−

= γ−, lim

xրE+

ρ(x)

  • E+ − x

= γ+, where ρ(x) is the continuous density of µ ⊠ ν.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 21 / 34

slide-24
SLIDE 24

Sketch of proof of Theorem 3

Analytic subordination functions

Proposition 1 Let µ and ν be probability measures on R+, both not δ0. There exist unique analytic self-maps Ωµ and Ων of C \ R+ satisfying the following: (i) limz→−∞ Ωµ(z) = limz→−∞ Ων(z) = −∞; (ii) For all z ∈ C+, Ωµ(¯ z) = Ωµ(z), Ων(¯ z) = Ωµ(z), and arg Ωµ(z) ≥ arg z, arg Ων(z) ≥ arg z; (iii) (Subordination) For all z ∈ C \ R+, Mµ(Ων(z)) = Mν(Ωµ(z)) = Mµ⊠ν(z); (iv) (Free multiplicative convolution) For all z ∈ C \ R+, Ωµ(z)Ων(z) = zMµ⊠ν(z).

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 22 / 34

slide-25
SLIDE 25

Sketch of proof of Theorem 3

Characterization of the edge

Let µ and ν satisfy the assumptions of Theorem 3. By Theorem 1 (iv) and Theorem 2, (Edges of supp µ ⊠ ν) ≡ (points at which analyticity of Mµ⊠ν breaks). Using the subordination functions, Mµ⊠ν(z) = Mν(Ωµ(z)), ∀z ∈ C \ R+. The subordination functions extend continuously to R. E ∈ R being an edge of supp µ ⊠ ν implies either (Ωµ is not analytic at E)

  • r

(Mν is not analytic at Ωµ(E)).

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 23 / 34

slide-26
SLIDE 26

Sketch of proof of Theorem 3

Stability bounds

0.6 0.8 1.0 1.2 1.4 1.6 0.02 0.04 0.06 0.08

Figure: Graph(orange) of Ωµ(· + 10−3i) for µ(1.1)

MP ⊠ µ(1.1) MP

and the support(red).

1.0 1.5 2.0 2.5 3.0 0.05 0.10 0.15 0.20 0.25 0.30

Figure: Graph(orange) of Ωµ(· + 10−3i) for (µ(1.5,3,5)

AS

)⊠2 and the support(red).

Proposition 2 Let µ and ν satisfy assumptions of Theorem 3. Then there exists a constant c > 0 such that inf

z∈C+ dist(Ωµ(z), supp ν) ≥ c,

inf

z∈C+ dist(Ων(z), supp µ) ≥ c.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 24 / 34

slide-27
SLIDE 27

Sketch of proof of Theorem 3

Stability bounds

0.780 0.785 0.790 0.795 0.800 0.805 0.810 0.815 0.820 0.000 0.005 0.010 0.015 0.020 0.025 0.030 0.035

Figure: Graph(orange) of Ωµ(· + 10−3i) for µ(1.1)

MP ⊠ µ(1.1) MP

and the support(red).

1.0 1.5 2.0 2.5 3.0 0.05 0.10 0.15 0.20 0.25 0.30

Figure: Graph(orange) of Ωµ(· + 10−3i) for (µ(1.5,3,5)

AS

)⊠2 and the support(red).

Proposition 2 Let µ and ν satisfy assumptions of Theorem 3. Then there exists a constant c > 0 such that inf

z∈C+ dist(Ωµ(z), supp ν) ≥ c,

inf

z∈C+ dist(Ων(z), supp µ) ≥ c.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 24 / 34

slide-28
SLIDE 28

Sketch of proof of Theorem 3

Singularity of subordination functions

From Proposition 1, we find the following heuristic equality: zMν(Ωµ(z)) = zMµ⊠ν(z) = Ωµ(z)Ων(z) =Ωµ(z)M−1

µ (Mµ⊠ν(z)) = Ωµ(z)(M−1 µ

  • Mν ◦ Ωµ)(z),

Thus Ωµ has an inverse z given by

  • z(Ω) = ΩM−1

µ

  • Mν(Ω)

Mν(Ω) . By inverse function theorem, we can guess that the analyticity of Ωµ breaks at z if z′(Ωµ(z)) = 0.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 25 / 34

slide-29
SLIDE 29

Sketch of proof of Theorem 3

Characterization of the edges

Proposition 3 Define V := ∂{x ∈ R : ρ(x) > 0}. For z ∈ C+ ∪ R, the following holds:

  • Ων(z)

Mµ(Ων(z))M′

µ(Ων(z)) − 1

Ωµ(z) Mν(Ωµ(z))M′

ν(Ωµ(z)) − 1

  • ≤ 1.

Furthermore, the equality holds if and only if z ∈ V. In this case, the equality remains true without taking the absolute value of LHS. Remark (i) In fact, z′(Ωµ(z)) = 0 is equivalent to the equality without modulus. (ii) We can prove that V consists of exactly two points {E−, E+}.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 26 / 34

slide-30
SLIDE 30

Sketch of proof of Theorem 3

Square root behavior

We can prove that z′′(Ωµ(E±)) = 0, so that in a neighborhood of E+, z = z(Ωµ(z)) = E+ + z′′(Ωµ(E+))(Ωµ(z) − Ωµ(E+))2 + o(|Ωµ(z) − Ωµ(E+)|3). Inverting the expansion, we have Ωµ(z) = c

  • z − E+ + o(|z − E+|3/2).

Recalling that Eρ(E) = 1 π Im Ωµ(E + i0)

  • x

|x − Ωµ(E+ + i0)|2 dν(x), we have the square root behavior around E+.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 27 / 34

slide-31
SLIDE 31

Behavior at the hard edge

Behavior at the hard edge

U: Haar unitary matrix, X1, X2: Ginibre ensembles

2 4 6 8 10 0.0 0.5 1.0 1.5 2.0 2.5

Figure: Limiting e.s.d. µMP ⊠ µAS

  • f (I + U)XX ∗(I + U∗).

1 2 3 4 5 6 7 1 2 3 4

Figure: Limiting e.s.d. µMP ⊠ µMP

  • f X2X1X ∗

1 X ∗ 2 .

Both densities diverge as x−2/3 as x → 0.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 28 / 34

slide-32
SLIDE 32

Behavior at the hard edge

Behavior at the hard edge

So far, when both of the measures µ and ν are separated from the hard edge, µ ⊠ ν shared the same property with µ ⊞ ν. Theorem (Banica, Belinschi, Capitaine and Collins, 2011 [1]) The density ρs of the fractional power µ⊠s

MP of µMP ≡ µ(1) MP satisfies

ρs(x) ∼ 1 πx−

s s+1

as x → 0. Remark It implies that the bound O(1/x) in Theorem 2 is optimal. If supports of µ and ν touches 0, i.e. E µ

− = E ν − = 0, Theorem 3 fails.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 29 / 34

slide-33
SLIDE 33

Behavior at the hard edge

Converting the singularity

If a measure dµ(x) = f (x)dx supported on (0, ∞) satisfies f (x) ∼ xα−1 so that µ((0, x]) ∼ xα as x → 0, (1) where α ∈ (0, 1), then for any realization X of µ, the distribution µ(−1) of X −1 satisfies µ(−1)((x, ∞)) ∼ x−α as x → ∞. Since (µ ⊠ ν)(−1) = µ(−1) ⊠ ν(−1), the case E µ

− = E ν − = 0 can be

converted to the case in which µ and ν are regularly varying around ∞.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 30 / 34

slide-34
SLIDE 34

Behavior at the hard edge

Regular variation and M-function

Suppose that µ((x, ∞)) ∼ x−α and ν((x, ∞)) ∼ x−β, with α, β ∈ (0, 1). The measures xdµ(x) and xdν(x) satisfy, as y → +∞, y xdµ(x) ∼ α 1 − αyµ((y, ∞)) ∼ α 1 − αy1−α, and y xdν(x) ∼ β 1 − β yµ((y, ∞)) ∼ β 1 − β y1−β. By Karamata’s Abelian-Tauberian theorem, as y → +∞, xdµ(x) x + y ∼ απ sin(απ)y−α and xdν(x) x + y ∼ βπ sin(βπ)y−β.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 31 / 34

slide-35
SLIDE 35

Behavior at the hard edge

Regular variation and M-function

Recalling Mµ(y) = 1 − xdµ(x) x − y −1 and combining above results, as w ց −∞ we get M−1

µ⊠ν(w) ∼ 1

w

  • − απw

sin(απ) 1

α

− βπw sin(βπ) 1

β

= −Cα,β(−w)

1 α + 1 β −1.

Going backwards, we conclude (µ ⊠ ν)(x, ∞) ∼ Dα,βx−(α−1+β−1−1)−1. (2) Remark Hazra and Maulik [6] showed that for all α ≥ 0, any reguarly varying µ with tail index α is free subexponential, i.e. µ⊞n(x, ∞) ∼ nµ(x, ∞).

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 32 / 34

slide-36
SLIDE 36

Behavior at the hard edge

Behavior at the hard edge

Now substituting µ and ν by µ(−1) and ν(−1), If µ and ν satisfy µ(0, x) ∼ xα and ν(0, x) ∼ xβ for some α, β ∈ (0, 1), then (µ ⊠ ν)(0, x) ∼ Dα,βx(α−1+β−1−1)−1. If we plug in α = β = 1/2, then (α−1 + β−1 − 1)−1 = 1 3, (3) which coincides with the case of µMP ⊠ µMP and µMP ⊠ µAS.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 33 / 34

slide-37
SLIDE 37

Bibliography

[1] T. Banica, S. T. Belinschi, M. Capitaine, and B. Collins. Free bessel laws. Canadian Journal of Mathematics, 63(1):3–37, 2011. [2] Z. Bao, L. Erd˝

  • s, and K. Schnelli.

On the support of the free additive convolution. arXiv e-prints, page arXiv:1804.11199, Apr 2018. [3] S. T. Belinschi. The atoms of the free multiplicative convolution of two probability distributions. Integral Equations Operator Theory, 46(4):377–386, 2003. [4] S. T. Belinschi. The Lebesgue decomposition of the free additive convolution of two probability distributions.

  • Probab. Theory Related Fields, 142(1-2):125–150, 2008.

[5] S. T. Belinschi. L∞-boundedness of density for free additive convolutions.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 33 / 34

slide-38
SLIDE 38

The end

  • Rev. Roumaine Math. Pures Appl., 59(2):173–184, 2014.

[6] R. S. Hazra and K. Maulik. Free subexponentiality.

  • Ann. Probab., 41(2):961–988, 2013.

[7] H. C. Ji. Properties of free multiplicative convolution. arXiv e-prints, page arXiv:1903.02326, Mar 2019. [8] V. A. Marˇ cenko and L. A. Pastur. Distribution of eigenvalues in certain sets of random matrices.

  • Mat. Sb. (N.S.), 72 (114):507–536, 1967.

[9] D. Voiculescu. A strengthened asymptotic freeness result for random matrices with applications to free entropy. International Mathematics Research Notices, 1998(1):41–63, 01 1998.

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 34 / 34

slide-39
SLIDE 39

The end

Thank you for listening!

Hong Chang Ji (KAIST) Free multiplicative convolution May 10, 2019 34 / 34