Abstract
Let , , be two Cauchy–Stieltjes Kernel (CSK) families induced by non-degenerate compactly supported probability measures and . Introduce the set of measures We show that if remains a CSK family, (i.e., where is a non-degenerate compactly supported measure), then the measures , and are of the Marchenko–Pastur type measure up to affinity. A similar conclusion is obtained if we substitute (in the definition of ) the additive free convolution ⊞ by the additive Boolean convolution ⊎. The cases where the additive free convolution ⊞ is replaced (in the definition of ) by the multiplicative free convolution ⊠ or the multiplicative Boolean convolution ⨃ are also studied.
Keywords:
variance function; free and Boolean convolutions; Cauchy–Stieltjes transform; Marchenko–Pastur law MSC:
60E10; 46L54
1. Introduction
Convolution stability is an important concept in probability theory, particularly in the study of probability laws and stochastic processes. It represents a fundamental concept that helps understand how certain probability laws behave under addition and has profound implications in various practical applications.
In [1], the authors studied the stability (with respect to classical convolution) of natural exponential families (NEFs) of probability measures: If the convolution of NEFs on remains a NEF, then the NEFs are all Poisson–Gaussian, up to affinity. This result is a generalization of the one-dimensional versions demonstrated in [2] in the case of two NEFs, and in [3] for more than two NEFs.
In non-commutative probability, the concept of Cauchy–Stieltjes kernel (CSK) families is newly defined. It concerns families of probability measures introduced in a manner similar to that of NEFs by involving the Cauchy–Stieltjes kernel (CSK) instead of the exponential kernel . The CSK families have been studied in [4] for measures with compact support. Further properties are proven in [5], by exploring measures with a one-sided support boundary, such as the one mentioned above. In this article, we study the stability of CSK families with respect to free and Boolean convolutions product. This stability property subsumes the CSK family induced by the Marchenko–Pastur type law and provides some new variance functions with non-usual expressions. The approach used in this article extends the understanding of CSK families and their stability in the non-commutative probability framework. In the rest of this section, after giving some basic concepts about CSK families, the purpose of this article is presented in more detail.
Let be a (non-degenerate) probability measure with a one-sided support boundary from above. Then,
converges ∀ with . The CSK family induced by is the family of probabilities
The map represent mean function. It is increasing strictly on , see [5]. The interval is said to be the mean domain of . This leads to the mean re-parametrization of . Let the inverse function of and for , write . We obtain
Consider
It is known from [5] that
where
is the Cauchy transform of .
The CSK family induced by a measure with a support bounded from below can also be introduced. It is denoted and parameterized by , where is either or with . The mean domain for is with . If is compactly supported, then is the two-sided CSK family.
The variance function (VF) is defined by (see [4])
If the first moment of does not exist, then all the laws in have infinite variance. The notion of pseudo-variance function is defined in [5] as
If exists finitely, then the VF exists (see [5]) and
Remark 1.
(i) determine μ: Consider then
Furthermore, if is finite, then
Consequently, and determine μ.
- (ii)
- Let be the image of μ by where and . Then, ∀m close to ,If the VF exists, then
- (iii)
- For , the Marchenko–Pastur law iswith . We know thatSee ([4], [Theorem 3.2]), for more details.
Now, we recall the definition of additive free convolution (see [6] for more details) and we present the purpose of this article. Denote by (respectively, by , , ) the set of non-degenerate probability measures on (respectively, the subset of measures from concentrated on the positive real line, with compact support, concentrated on the positive real line and compactly supported). The additive free convolution of and is the measure denoted as , satisfying
where the free cumulant transformation, , of is
The objective in this article related to the ⊞-convolution is as follows: Let , , be two CSK families induced by and . Introduce the family of probabilities
We demonstrate that if remains a CSK family, (i.e., for ), then the measures , and are of the Marchenko–Pastur type law up to affinity. We obtain the same conclusion if we replace (in the definition of ) the additive free convolution ⊞ by the additive Boolean convolution ⊎. The cases where the additive free convolution ⊞ is replaced (in the definition of ) by the multiplicative free convolution ⊠ or the multiplicative Boolean convolution ⨃ are also studied. This provides some new VFs with non-usual forms.
2. Main Results
2.1. Stability of CSK Families by Free Additive Convolution Product
Theorem 1.
Let , . Introduce the family of measures
If remains a CSK family, (i.e., for ), then μ, and are of the Marchenko–Pastur type law up to affinity.
Proof.
We omit the proof because it is the same when considering in the proof of ([7], [Theorem 2]). □
2.2. Stability of CSK Families by Boolean Additive Convolution Product
For , , the additive Boolean convolution is the probability measure introduced by
where
See [8] for more details.
Theorem 2.
Let , . Introduce the family of probabilities
If remains a CSK family, (i.e., for ), then σ, and are of the Marchenko–Pastur type law up to affinity.
Proof.
Assume that for , (we may suppose, without loss of generality, that ). Then, ∀ and ∀, there is , so that
Or equivalently, ∀ large enough
For , the Boolean cumulant transform of may be expressed as
where and denotes, respectively, the first and the second Boolean cumulants of . It follows from ([9], [Equation 3.2]) that
So, relation (2) reduces to
Similarly, the Boolean cumulant transforms of and may be written as
and
When in (6), we obtain . So, Equation (6) is reduced to
Multiplying by in both sides of (7) and letting , we obtain
According to [10], we obtain
The parameter should be strictly positive. In addition, . Otherwise cannot be a VF, see ([11], [page 6]). Clearly from (8), measures , and are of Marchenko–Pastur type law up to affinity. □
2.3. Stability of CSK Families by Multiplicative Free Convolution Product
For , the -transform is defined by
The product of -transforms is an -transform and defines, for , , the multiplicative free convolution , by . See [6,12] for more details.
Theorem 3.
Let , . Introduce the family of probabilities
If remains a CSK family, (i.e., for ), then σ, and are such that
and
and are positive strictly and with .
Proof.
Suppose that for some . Then ∀ and ∀, there is , so that
That is, ∀z close to 0
We know that . Thus
Then, . Using ([13], [Theorem 3.3]), the -transforms of measures , and may be written as
and
Combining (12), (13), (14) and (15), we obtain
On the other hand, it is well known that the solutions the functional equation
where the functions , and are continuous and , , is
c, and arbitrary constants.
Remark 2.
(i) Up to affinity, we may suppose that , i = 1, 2.
- (ii)
- For , we have , and . Thus, the parameters and must strictly be positive. In that case, the measures , and σ are of free Gamma type law up to affinity. For more details about free Gamma CSK family, see ([4], [Theorem 3.2]).
- (iii)
2.4. Stability of CSK Families by Boolean Multiplicative Convolution Product
In [14], a multiplicative concept of Boolean additive convolution was introduced. For , the map
is univalent in . It is known that the circle with diameter contains . In addition, . We also have Following [15], the -transformation of is provided as follows:
As is well known, , and , for . Furthermore, , for .
The transform
is well defined for . The Boolean multiplicative convolution of and is the unique probability measure in , represented as , that fulfills
For satisfying
- (i)
- (ii)
- at least one of the first moments of one of the probabilities or is finite, the measure is well defined.
Theorem 4.
Let , . Introduce the family of probabilities
If remains a CSK family, (i.e., for ), then , and σ are such that
and
and are strictly positive and with .
Proof.
Suppose that for some . Then, ∀ and ∀, there is , so that
That is, ∀z close to 0
On the other hand, the multiplicative Boolean cumulant transform is related to the additive Boolean cumulant transform as
Based on (23), (3), (4) and (5), one can obtain
and
Combining (22) with (24), (25) and (26), we obtain
When in (27), we obtain . Thus, relation (27) reduces to
Dividing by z in both sides of (28) and let , one obtains . Recalling (17), we obtain from (18)
and
Remark 3.
(i) Up to affinity, we may suppose that , i = 1, 2.
- (ii)
- Note that for , we have , and . Thus, the parameters and must be positive strictly. In that case the measures , and σ are of Marchenko–Pastur type law up to affinity.
- (iii)
3. Conclusions
This article provides significant insights into the stability of CSK families under both free and Boolean convolutions. Let , , be two CSK families induced by and . Introduce the family of measures
We have proved that if remains a CSK family, (i.e., for ), then , and are of the Marchenko–Pastur type law up to affinity. We obtain the same conclusion if we replace (in the definition of ) the additive Boolean convolution ⊎ with the additive free convolution ⊞. Other cases are also studied where the additive Boolean convolution is replaced (in the definition of ) by the multiplicative free convolution ⊠ or the multiplicative Boolean convolution ⨃. This provides to some new VFs with logarithmic terms. In fact, in many cases, the variance of the response variable increases with the mean. A logarithmic transformation can help stabilize the variance, making it more constant across different levels of the predictor variables. Furthermore, the logarithmic function has desirable mathematical properties that can simplify the analysis, such as transforming multiplicative relationships into additive ones, which are easier to handle in regression analysis. In addition, in some cases, there might be theoretical reasons based on the underlying processes generating the data that suggest a logarithmic relationship between the mean and variance.
Author Contributions
Conceptualization, A.R.A.A. and S.S.A.; methodology, R.F.; validation, A.R.A.A. and S.S.A.; investigation, S.S.A.; resources, S.S.A. and R.F.; writing—original draft, R.F.; writing—review and editing, R.F.; visualization, A.R.A.A. and S.S.A.; supervision, R.F.; project administration, A.R.A.A.; funding acquisition, A.R.A.A. All authors have read and agreed to the published version of the manuscript.
Funding
This research is funded by the Deanship of Graduate Studies and Scientific Research at Jouf University through the Fast-Track Research Funding Program.
Data Availability Statement
Data are contained within the article.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Koudou, A.E.; Pommeret, D. A Characterization of Poisson-Gaussian Families by Convolution-Stability. J. Multivar. Anal. 2002, 81, 120–127. [Google Scholar] [CrossRef] [Scilit]
- Letac, G. Lectures on Natural Exponential Families and Their Variance Functions; Instituto de Matemtica Pura e Aplicada: Monografias de Matemtica, Rio de Janeiro, Brazil, 1992; Volume 50. [Google Scholar]
- Pommeret, D. Stabilité des familles exponentielles naturelles par convolution. C. R. Acad. Sci. Sr. I 1999, 328, 929–933. [Google Scholar]
- Bryc, W. Free exponential families as kernel families. Demonstr. Math. 2009, 42, 657–672. [Google Scholar] [CrossRef] [Scilit]
- Bryc, W.; Hassairi, A. One-sided Cauchy-Stieltjes kernel families. J. Theoret. Probab. 2011, 24, 577–594. [Google Scholar] [CrossRef] [Scilit]
- Bercovici, H.; Voiculescu, D. Free convolution of measures with unbounded support. Indiana Univ. Math. J. 1993, 42, 733–773. [Google Scholar] [CrossRef]
- Alanzi, A.R.A.; Alqasem, O.A.; Elwahab, M.E.A.; Fakhfakh, R. Some Results on the Free Poisson Distribution. Axioms 2024, 13, 496. [Google Scholar] [CrossRef] [Scilit]
- Speicher, R.; Woroudi, R. Boolean convolution. Fields Inst. Commun. 1997, 12, 26727. [Google Scholar] [CrossRef] [Scilit]
- Fakhfakh, R. Variance function of boolean additive convolution. Stat. Probab. Lett. 2020, 163, 108777. [Google Scholar] [CrossRef] [Scilit]
- Friedman, D. The functional equation f(x+y)=g(x)+h(y). Am. Math. Mon. 1962, 69, 769–772. [Google Scholar] [CrossRef] [Scilit]
- Fakhfakh, R. A characterization of the Marchenko-Pastur probability measure. Stat. Probab. Lett. 2022, 19, 109660. [Google Scholar] [CrossRef] [Scilit]
- Belinschi, S.T. Complex Analysis Methods in Noncommutative Probability; ProQuest LLC.: Ann Arbor, MI, USA, 2005. [Google Scholar]
- Noriyoshi, S.; Hiroaki, Y. New limit theorems related to free multiplicative convolution. Stud. Math. 2013, 214, 251–264. [Google Scholar]
- Bercovici, H. On Boolean convolutions. In Operator Theory 20; MR2276927l; Theta: Bucharest, Romania, 2006; Volume 6, pp. 7–13. [Google Scholar]
- Anshelevich, M.; Wang, J.C.; Zhong, P. Local limit theorems for multiplicative free convolutions. J. Funct. Anal. 2014, 267, 3469–3499. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).