Regression conditions that characterizes free--Poisson and free--Kummer distributions
Agnieszka Piliszek

TL;DR
This paper characterizes free--Poisson and free--Kummer distributions through spectral analysis and independence properties, extending classical results to non-commutative probability and random matrix theory.
Contribution
It introduces a free analogue of HV independence and provides new characterizations of free--Kummer and free--Poisson distributions.
Findings
Spectral distribution of random Kummer matrix derived
Free HV independence property formulated and proved
Characterization of free--Kummer and free--Poisson variables established
Abstract
We find the asymptotic spectral distribution of random Kummer matrix. Then we formulate and prove a~free analogue of HV independence property, which is known for classical Kummer and Gamma random variables and for Kummer and Wishart matrices. We also prove a related characterization of free--Kummer and free--Poisson (Marchenko-Pastur) non--commutative random variables.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Bayesian Methods and Mixture Models · Statistical Methods and Bayesian Inference
REGRESSION CONDITIONS THAT CHARACTERIZE FREE–POISSON AND FREE–KUMMER DISTRUBTIONS
Agnieszka Piliszek
Agnieszka Piliszek
Wydział Matematyki i Nauk Informacyjnych
Politechnika Warszawska
Koszykowa 75
00-662 Warszawa, Poland
Abstract.
We find the asymptotic spectral distribution of random Kummer matrix. Then we formulate and prove a free analogue of HV independence property, which is known for classical Kummer and Gamma random variables and for Kummer and Wishart matrices. We also prove a related characterization of free–Kummer and free–Poisson (Marchenko-Pastur) non–commutative random variables.
1. Introduction
This paper concerns some connections between classical and non-commutative probability, especially the links between independence and freeness. We prove a free-analogue of a classical indpendence property of Kummer and Gamma random variables. Similar attempts have been succesfull for the Lukacs’ characterization of the Gamma distribution, [3, 19], as well as for the Matsumoto-Yor characterization of GIG and Gamma distributions, [21]. Earlier, also Kac–Bernstein characterization of independent Gaussian random variables, [2] was proved for semicircle free non-commutative random variables, [14]. However it is not clear which of independence characterizations known for commutative random variables, would also hold for their non–commutative counterparts (and what would be the counterparts). An important property of classical Gaussian random variables, known as Cramer’s Theorem, does not hold in a free probability setting, [1].
Let us recall that a random variable has the Gamma distribution with parameters , we write , if it has a density function
[TABLE]
A random variable has the Kummer distribution with parameters , , we write , if it has a density function
[TABLE]
An interesting property noticed in [7] says, that if and are independent, then random variables
[TABLE]
are also independent and , . We call this property the HV property refering to the names of its authors, [7]. In [15], under the assumption that densities of and are locally integrable, the converse theorem was proved: if and are independent and and , defined in (1), are independent, then necessarily and for some constants and . In [16] it was shown that instead of independence of and , it is enough to assume constant regression conditions: and (in fact there is a whole range of equivalent conditions, see [16]). Some of other properties and characterizations of this type (we mean regression conditions) have its counterparts in non-commutative probability:
- •
Kac–Bernstein characterization of Gaussian distribution, [2], and related free characterization of Wigner law, [14];
- •
Lukacs’ Theorem, [12], which characterizes Gamma distribution through independence of and . In the non-commutative version Marchenko-Pastur (free-Poisson) distribution is characterized by conditions:
[TABLE]
in [3] or by constant conditional moments of order and of in [20];
- •
Matsumoto–Yor property and related characterization of GIG and Gamma, [11], also have their counterparts in free probability, cf. [21].
These results, among others, indicate certain link between commutative and non–commutative probability and between independence and freeness.
In this paper we give one more link of a similar type, which seems to be of interest on its own. The basic aim of this paper is to find a pair of distributions such that if and are free, self-adjoint random variables from some algebra , then and are also free. One may compare this transformation with (1), as it is a generalization of (1). It seems justified to use free-Poisson as , which played the role of the Gamma distribution in both cases of Lukacs’ and Matsumoto-Yor theorems, [14, 21]. A candidate for is considered in Section 3, and free property of and is proven in Section 4. Section 5 contains the main result of the paper (Thm. 5.2): the constant regression characterization of the measures and .
2. Preliminaries
A broad introduction to free probability can be found in [8] or [13]. To increase accessability of the paper we recall that part of this theory we need in order to present our results.
Let be a -algebra and be a linear functional such that , where . We assume that is faithful, normal, tracial and positive. We call the pair a non–commutative -probability space and elements of are called non-commutative random variables .
An important case is , where is a Hilbert space and denotes the space of bounded linear operators from to . If is von Neummann algebra, then we say that is -probability space.
Let be bounded. The numbers , for are called moments and by *joint distribution * of we mean the collection of all moments. For a bounded, self–adjoint random variable we can define the -distribution of as a unique, real, compactly supported probability measure . This measure is uniquely determined as such that for all
[TABLE]
If the support of is contained in , then we say that is positive. For a –tuple of self–adjoint random variables its joint distribution is defined as the linear functional such that for any polynomial in non-commuting variables the following equality holds:
[TABLE]
Let be a non–commutative probability space and let be a finite index set. For each let be a unital subalgebra. The subalgebras are called free or freely independent, if whenever the following four conditions hold:
- (1)
is a positive integer, 2. (2)
() for all , 3. (3)
for all , 4. (4)
neighbouring elements are from different subalgebras, i.e., .
We say that random variables , for each , are free or freely independent, if are free, where is a subalgebra of generated by for each . Freeness of non-commutative random variables can be also expressed conveniently in terms of free–cumulants.
Let denote the set of all non–crossing partitions of the set . We define free cumulants , as multi-linear functionals by the recursive moment-cumulant relation
[TABLE]
where is a product of cumulants over all blocks of and the arguments are given by the elements corresponding to the respective blocks. For example, if then . So , and so on.
Random variables and are free if and only if whenever: , for all and there are at least two indices , such that , , cf. [18]. Throughout following sections, we will use a well known formula, which connects free cumulants and moments:
[TABLE]
where , , cf. [4].
2.1. Analytical tools
Let be a non-commutative probability space. Let . Let us recall that the –transform of a random variable is:
[TABLE]
where . It is known that if has a compact support, then its –transform is an analytic function in the neighborhood of [math] (as a function of complex variable). For a self–adjoint, bounded from a -algebra with a state and -distribution its Cauchy transform is
[TABLE]
for . Let and . Then is an analytic function from to (Lemma 3.1.2 in [13]). Cauchy transform uniquely determines the distribution and measure can be recovered form by Stieltjes inversion formula:
Proposition 2.1** (Theorem 3.1.6 in [13]).**
If is a probabilistic measure on and is its Cauchy transform, then for every
[TABLE]
Furthermore, if for probability measures and their Cauchy transforms are equal , then .
Notice, that the Stieltjes formula implies that the support of contains the set
[TABLE]
The moment transform of (or of its -distribution ) is
[TABLE]
for . It is clear that
[TABLE]
Proposition 2.2** ([25]).**
Let be a probabilistic measure on such that . Then is injective on and the image is an open set contained in a disc centered in and of diameter . Furthermore
[TABLE]
So , the inverse of is well defined. For a positive random variable and its -distribution the S–transform is
[TABLE]
Proposition 2.3** (Theorem 4.5.3.23 from [13]).**
If and are free non-commutative positive random variables, then for in a neighbourhood of [math]:
[TABLE]
2.2. Asymptotic freeness
Consider a family of random variables on a probabilisty space , . We say that -distribution converges to when tends to infinity, if for any polynomial in non-commutative variables :
[TABLE]
If is a -distribution of , we say that converges in distribution to . Then
[TABLE]
for any . If additionally are free, then we say that is asymptotically free.
Empirical spectral distribution of random matrix is a random measure
[TABLE]
where are eigenvalues of (possibly multiple in algebraic meaning).
Classical and powerful result on connection between random matrices and free random variables is due to Voiculescu, [24]. Here we cite more general formulations from Chapter 4 in [8].
Proposition 2.4**.**
Consider random matrices and such that: both and have almost surely an asymptotic spectral distribution when ; and are independent for ; is unitarily invariant. Then and (as random variables in , where is the algebra of matrices and ) are almost surely asymptotically free.
In [21] Szpojankowski used Theorem 2.4 to prove the Matsumoto-Yor property in a non–commutative setting. Here we will adapt this approach to some extent in order to prove the non–commutative HV property. The random matrix version of HV property is the starting point for this approach. It has been proved recently in [10] (Theorem 2.2.) and we cite it below.
Let be the set of real symmetric matrices. By we denote the cone of positive definite symmetric matrices. We say that random matrix has the matrix–Kummer distribution with parameters , and , if it has the density:
[TABLE]
where is the confluent hypergeometric function of the second kind of a matrix argument (see for instance formula (2) in [9]), and is identity in . Symbol “” denots scalar product of matrices and , so .
The Wishart distribution with parameters and , , has the density
[TABLE]
Proposition 2.5** (Thm. 2.2. in [10]).**
Let and be two independent random matrices valued in . Assume that has the matrix–Kummer distribution and has the Wishart distribution , where , , . Then random matrices
[TABLE]
are independent. Furthermore, and .
Remark 2.1**.**
It is known that if we take a sequence of real Wishart matrices with parameters and , where , and then the free Poisson distribution is an almost sure weak limit of the empirical spectral distributions of .
Probability measure defined for and by
[TABLE]
where the measure is supported on the interval and has density
[TABLE]
is called the free Poisson or Marchenko–Pastur distribution. The parameter is called the rate and – the jump size. If has free–Poisson -distribution with parameters and , we denote it .
3. Asymptotic eigenvalue distribution of matrix–Kummer random matrix
In order to state the free HV property we need to find free counterpart of the classical Kummer distribution. In fact we will seek the asymptotic eigenvalue distribution of matrix–Kummer matrices.
We recall a standard result on an eigenvalue distribution, which can be found in [8] (Prop. 4.1.3).
Proposition 3.1**.**
Let be symmetric random matrix and let be its density with respect to the Lebesgue measure on . Assume that there exists a function such, that
[TABLE]
*where are eigenvalues of symmetric .
Then the density of the vector of eigenvalues of has the following form*
[TABLE]
Definition 3.1**.**
If is a density on with respect to Lebesgue measure and
[TABLE]
where , then function is called potential of .
Let , where , , . Then by (5) the function defined in Prop. 3.1 has the form
[TABLE]
where and . From Prop. 3.1 it follows that eigenvalues of have joint density:
[TABLE]
where is the normalizing constant, and .
From now on let , and . Moreover, let be the potential related to the density (6), i.e.:
[TABLE]
We also assume that , , , so that .
In the complex matrix case, one can set , and and then potential does not depend on and one can use classical results to get the limit of empirical measure. Here we use the following result from [6]:
If
- (a)
for any : is continuous;
- (b)
there exist and such that
[TABLE]
- (c)
there exists such that uniformly converges to as on compact subsets of ,
then the random measure almost surely converges weakly to a probability measure as . The measure minimizes the functional
[TABLE]
called the energy of a field with external potential . Properties of the measure , called the equilibrium measure, have been deeply analysed, see [17] for instance. The facts we use below also can be found in [17] (see Theorems IV.1.11 and IV.3.1 there).
If is convex on some closed interval or is increasing on then the support of the equilibrium measure is a closed interval , where and are such that
[TABLE]
Then
[TABLE]
For related to Kummer eigenvalues (see (7)) we have
[TABLE]
That is conditions (a), (b), (c) are satisfied. Note that if then is convex on and if then is increasing on . So in both cases and (8) holds. The system of equations (8) can equivalently be written as:
[TABLE]
. To see this, one can use Cauchy’s residual theorems to calculate the integrals, which appear in (8).
Moreover, in this case the equilibrum measure is
[TABLE]
Note that the measure depends on through (10). The distribution defined in (11) will be called the free–Kummer distribution with parameters , , . We will write if is -distribution of .
We sum up preceding calculations in the remark below.
Remark 3.1**.**
If , where and , and , then the limiting spectral distribution of is free–Kummer .
Lemma 3.2**.**
The Cauchy transform of free–Kummer is
[TABLE]
Our approach to proving Theorem 4.1 (see Lemma 4.2) requires the largest eigenavlue of Kummer matrix to be asymptotically a.s. bounded. For this reason we introduce the large deviation principle (LDP). We say that the LDP with a rate function and speed holds for a sequence of measures , if for any Borel set
[TABLE]
where is the interior and is the closure of . Function is a good rate function, if for any the set is compact.
Proposition 3.3**.**
The largest eigenvalue of the Kummer matrix converges almost surely to (right end of the support) and satisfies the LDP on with speed and the good rate function
[TABLE]
Corollary 3.4**.**
The largest eigenvalue of matrix Kummer random matrix is asymptotically almost surely bounded.
4. Freeness property of free–Poisson and free–Kummer free variables
Now, we are ready to state HV property for non–commutative random variables.
Theorem 4.1**.**
Let be a -probability space. Assume that be free random variables and , , with and . Let and . Then and are free. Moreover, and .
To prove Theorem 4.1, we need a technical result related to convergence in probability, which is a generalization of a lemma from [21].
Lemma 4.2**.**
Let be two independent sequences of random matrices on probabilistic space , where , are matrices for every . Suppose that and have almost surely weak limits of their sequences of the empirical spectral distributions, and , respectively. Also suppose that the smallest eigenvalue of is asymptotically almost surely larger than a constant and that the largest eigenvalue of is asymptotically almost surely smallert than a constant . Let be -probability space.
Assume that there exist such that and are free and , . Then for any complex polynomial in three non-commuting variables and for any we have
[TABLE]
In [21] this lemma was proved in special case of with free GIG distribution, and with free Poisson distribution. Although our formulation is more general the proof remains the same, so we skip it.
Corollary 4.3**.**
Let be a -probability space. Assume that there exist such that and are free, and . Let be two sequences of random matrices, such that and are independent for each and , , . Then for any complex polynomial in three non-commuting variables and for any we have
[TABLE]
5. Free regression characterization of HV type
5.1. Conditional expectation in a non-commutative probability space
In the next subsection we will formulate free version of the following characterization theorem from [16], which holds in the classical probability setting.
Proposition 5.1**.**
Let and be independent, positive, non-degenerate (commutative) random variables, such that , and . Let , and assume that there exist real constants and such that and Then and there exists a constant such that
[TABLE]
We will recall the definition of non-commutative conditional expectation following [3, 23]. Let be a –probability space. Let be a von Neumann subalgebra of . Then there exists a unique faithful, normal projection such that . We call it a non-commutative conditional expectation from to with respect to (see [23], Vol I p. 332). The conditional expectation of a self–adjoint element is a unique self–adjoint element of .
We cite, following [3], two important properties of a non-commutative conditional expectation , which will be used in the proof of Theorem 5.2.
- I.
If random variables are free, then ; 2. II.
If , , then
5.2. The characterization theorem
Theorem 5.2**.**
Let be a non–commutative –probability space. Let and be self–adjoint, positive, free, compactly supported and non-degenerate random variables. Define
[TABLE]
and assume that there exist constants such that
[TABLE]
[TABLE]
Then and there exists such that ), , where .
6. Concluding remarks
We have proved that free Poisson and free Kummer are the only probability distributions which maintain freeness of non-cummutative random variables when transformed by the following mapping
[TABLE]
As has been mentioned in [10], in the matrix setting one can consider a different transformation:
[TABLE]
that preserves independence for Kummer and Wishart random matrices. It is still unknown if a related characterization holds for random matrices as well as if its free counterpart is true.
An open question of a broader nature would be: does every independence characterization of random matrices has its analogon in free probability. Examples that have been studied suggest that answer could be positive. If so, then how to find it?
7. Proofs of Sec. 3
7.1. Proof of Lemma 3.2
Proof.
It is enough to show that
- (1)
[TABLE] 2. (2)
[TABLE]
These equalities can be obtained using the Cauchy Residual Theorem. The square root above denotes its main branch. So and . Another choice of branch is not possible, since has a compact support and has to be equal to [math] due to Thm. 2.1 (Stieltjes’ Inversion Formula). ∎
7.2. Proof of Proposition 3.3
Proof.
We repeat the reasoning from the proof of Theorem 2 in [5].
Let
[TABLE]
where is defined in (9). Notice that for all . Since
[TABLE]
is positive (), then is increasing on . The remaining part of the proof follows from the arguments in Section 4.2 in [5]. ∎
8. Proofs of Sec. 4
8.1. Proof of Corollary 4.3
Proof.
The sequences of empirical spectral distribution of matrices and almost surely have their weak limits: and . Eigenvalues of are greater than . It implies that the support of the weak limit of empirical spectral measure of sequence is separated from [math]. Also the largest eigenvalue is asymptotically almost surely bounded as (Cor. 3.4). Then the result follows from Lemma 4.2. ∎
8.2. Proof of Thm. 4.1
Proof.
We want to show that the algebras generated by and are free.
Let us take a sequence of Wishart matrices with parameters and , such that , , and , and . Moreover let be a sequence of Kummer matrices with parameters , and . Assume that and are independent. Then since matrix–Kummer and Wishart matrices are unitarily invariant and both have almost sure limiting eigenvalue distributions, they are asymptotically free (Thm. 2.4). It means that if is the algebra of random matrices of size with integrable entries with the state on , then for any polynomial in two non–commuting variables we have almost surely
[TABLE]
where and are as in the statement of the theorem.
By the HV property for random matrices it follows that for any
[TABLE]
are independent, and . They are also almost surely asymptotically free. Let be the limiting pair of non–commuting free random variables.
Then for any polynomial , there exists such, that we have
[TABLE]
From Corollary 4.3 we know that converges in probability to
[TABLE]
However, by (16) the sequence has almost sure limit and thus we have
[TABLE]
where the last equality follows from the relation between and .
Thus joint moments of and are the same. Since and are free, then and are also free (recall that freeness is defined by joint moments).
From Remark 2.1 and Remark 3.1 we have that and . ∎
9. Proofs of Sec. 5
9.1. Proof of Theorem 5.2
Proof.
Step 1. First step is to show that is free–Poisson random variable.
For any we multiply both sides of (14) by and take expectation . Due to the property (II) we have
[TABLE]
Similarly, if we multiply Eq. (15) by and take expectation, we have
[TABLE]
We obtain a system of recursive equations holding for any
[TABLE]
where for :
[TABLE]
For instance, notice that and . For from neighbourhood of [math] we can define
[TABLE]
From Eq. (17) we obtain
- (d)
[TABLE] 2. (e)
[TABLE]
Also, denote a -transform of and
[TABLE]
where
[TABLE]
Then these three relations hold:
- (a)
:
From (2) it follows that for any we have
[TABLE]
where is -th free cumulant of .
So
[TABLE]
- (b)
:
From (2) it follows that for any we have
[TABLE]
Then
[TABLE]
- (c)
:
Note that for we have
[TABLE]
Again Eq. (2) implies
[TABLE]
If we multiply by and sum over , we have:
[TABLE]
To determine distribution of we will solve the system of equations (a)-(e) with respect to . We rewrite the system here:
- (a)
,
- (b)
,
- (c)
,
- (d)
,
- (e)
.
Firstly, we multiply Eq. (e) by and then we plug it into Eq. (c). We obtain
[TABLE]
Let . Then (a) can be written in terms of as: . From this and above equation we get:
[TABLE]
Then after simplification
[TABLE]
On the other hand we can plug from (b) into (d) and then multiply it by . Now we have
[TABLE]
In terms of it reads as
[TABLE]
Comparing the left-hand sides of (18) and (19), we arrive at
[TABLE]
Which can equivalently be written as
[TABLE]
Since the -transform of is analytic near [math] and (see definition of ), then for close to [math] we have:
[TABLE]
The last equality holds due to the fact, that . Eventually, we have
[TABLE]
where and . It is an -transform of free-Poisson distribution with parameters and .
Step 2. To recover Cauchy transform of we use (a), (b) and (d). From (a) and formula for we can deduce that for in a neighbourhood of [math]
[TABLE]
Plugging it into (b) we get . We plug that last in (d), which gives quadratic equation for :
[TABLE]
where . Solution has the following form:
[TABLE]
The square root in the last line has to be correctly understood, as it will be explained in the remaining part of the proof.
Since Cauchy transform of satisfies (see (4))
[TABLE]
then
[TABLE]
where
[TABLE]
We have to find an admissible set of parameters , such that is Cauchy transform of the probabilistic measure associated with . For that reason we analyse the polynomial , which is under the square root in formula (21). In the remainder of the proof, we will match formula (21) with the expression (12) for the Cauchy transform of a free Kummer distribution, in particular identifying appropriate roots of the polynomials as the boundary of the support of this distribution. It is known that is analytic on and the image . We assumed that -distribution of is supported in . These facts imply, that
does not have roots in and so it does not have complex roots at all; thus it has (possibly multiple) real roots;
can not be negative for negative (real) arguments: this follows from Stieltjes formula (3).
The roots of are: , and . Since and and , then from (14):
[TABLE]
Therefore , which will be important later on in the proof. Now we sketch the graph of – see the first panel in Fig. (1).
We will show that has two double real roots now. Let
[TABLE]
where . Then and has the same roots as . Note, that the discriminant of is positive. Indeed:
[TABLE]
where the last equality holds because .
We denote roots of : . If , then Viete’s formula implies . Then if , we have . But this contradicts to the fact that . On the other hand, when , then and do not intersect (which is contrary to ) or they intersect in the second quarter of the plane. It contradicts . This case is presented in the second panel of Fig. 1.
So we conclude that . Or equivalently
[TABLE]
Now, we want to show that has two (distinct) positive roots and a negative double root. Suppose that has four different roots. Since and for , then two roots of are negative. We denote them . So is negative in the interval (see Fig. 2), which is contrary to . This implies has double root ( and are tangents at ). Since and cannot be tangent outside interval , then . This is in the second chart in Fig. 2. The other points of intersection of and are positive .
We have
[TABLE]
where
[TABLE]
To find out how and depend on , and we use Viete’s formula once again. We have
[TABLE]
[TABLE]
Since and (22) holds, then from Eq. (23)
[TABLE]
Let . Then
[TABLE]
where
[TABLE]
Notice that if , then is a root of . So roots of are exactly (double root), and . Again from Viete’s formula we have
[TABLE]
From Eq. (26) and again from , we have
[TABLE]
Let us recall that roots and are the boundary of the support of . Combining (24) with (27), we have
[TABLE]
[TABLE]
These are exactly conditions from (10) for the boundary points of the support of free Kummer distribution with parameters , and . So we have
[TABLE]
and from (21)
[TABLE]
where and are such that (28) and (29) hold. Since the support of is bounded, we choose the main branch of square root (see the second part of the proof of Lem. 3.2 for further reasoning). We finally obtained Cauchy transform of free Kummer with parameters , , .
Step 3. Having the distributions of and already identified, we can calculate by its -transform. Let denote the -transform of random variable . Given that and are free, Thm. 2.3 implies
[TABLE]
and this equality uniquely determines distribution of . Theorem 4.1 implies that . ∎
Acknowledgments
This research was supported by the grant 2016/21/B/ST1/00005 of National Science Center, Poland.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] H. Bercovici and D. Voiculescu. Superconvergence to the central limit and failure of the Cramér theorem for free random variables. Probab. Theory Relat. Fields , 102:215–222, 1995.
- 2[2] S.N. Bernstein. On a property which characterizes Gaussian distribution. Zap. Leningrad Polytech. Inst. , 217:21–22, 1941.
- 3[3] M. Bożejko and W. Bryc. On a class of free Lévy laws related to a regression problem. J. Funct. Anal. , 236:59–77, 2006.
- 4[4] M. Bożejko, M. Leinert, and R. Speicher. Convolution and limit theorems for conditionally free random variables. Pacific J. Math. , 175(2):357–388, 1996.
- 5[5] D. Féral. The limiting spectral measure of the generalised inverse Gaussian random matrix model. C. R. Math. Acad. Sci. Paris , 342(7):519–522, 2006.
- 6[6] D. Féral. On large deviations for the spectral measure of discrete Coulomb gas. Séminaire de probabilités XLI. Lecture Notes in Math. , 1934:19–49, 2008.
- 7[7] M. Hamza and P. Vallois. On Kummer’s distributions of type two and generalized beta distributions. Statist. Probab. Lett. , 118:60–69, 2016.
- 8[8] F. Hiai and D. Petz. The Semicircle Law, Free Random Variables and Entropy (Mathematical Surveys & Monographs) . American Mathematical Society, Boston, USA, 2006.
