Next Article in Journal
Enhancing Wildfire Detection via Trend Estimation Under Auto-Regression Errors
Previous Article in Journal
Recent Progress in Ocean Intelligent Perception and Image Processing and the Impacts of Nonlinear Noise
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Invariance Property of Cauchy–Stieltjes Kernel Families Under Free and Boolean Multiplicative Convolutions

1
Department of Mathematics, College of Science, Jouf University, P.O. Box 2014, Sakaka 72311, Saudi Arabia
2
Department of Mathematical Sciences, College of Science, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(7), 1044; https://doi.org/10.3390/math13071044
Submission received: 2 January 2025 / Revised: 2 March 2025 / Accepted: 21 March 2025 / Published: 23 March 2025
(This article belongs to the Section D1: Probability and Statistics)

Abstract

:
This article delves into some properties of free and Boolean multiplicative convolutions, in connection with the theory of Cauchy–Stieltjes kernel (CSK) families and their respective variance functions (VFs). Consider K ( μ ) = { Q m μ ( d s ) : m ( m μ , m 0 μ ) } , a CSK family induced by a non-degenerate probability measure μ on the positive real line with a finite first-moment m 0 μ . For γ > 1 , we introduce a new family of measures: K ( μ ) γ = Q m μ γ ( d s ) : m ( m μ , m 0 μ ) . We show that if K ( μ ) γ represents a re-parametrization of the CSK family K ( μ ) , then μ is characterized by its corresponding VF V μ ( m ) = c m 2 ln ( m ) , with c > 0 . We also prove that if K ( μ ) γ is a re-parametrization of K ( D 1 / γ ( μ γ ) ) (where ⊞ is the additive free convolution and D a ( μ ) denotes the dilation μ by a number a 0 ), then μ is characterized by its corresponding VF V μ ( m ) = c 1 ( m ln ( m ) ) 2 , with c 1 > 0 . Similar results are obtained if we substitute the free multiplicative convolution ⊠ with the Boolean multiplicative convolution ⨃.

1. Introduction

In probability theory, the basic concept of convolution is important in understanding interactions between random variables, particularly when they are independent. However, when extending the concept of probability to noncommutative structures, such as free probability and Boolean probability, the classical convolution operation is no longer suitable. The study of free and Boolean convolutions in noncommutative probability offers rich new perspectives for understanding the behavior of random elements in these settings, providing insights into the algebraic and statistical properties of the systems beyond the classical framework.
Free probability, introduced by Dan Voiculescu in the early 1980s [1], generalizes classical probability theory to the context of random variables associated with noncommutative algebras; see [2,3,4,5]. In this context, free multiplicative convolution appears as a natural extension of classical multiplicative convolution, where instead of independent random variables, we consider random elements in a noncommutative algebra that are free (i.e., they satisfy some form of noncommutative independence). This convolution is essential to the study of the behavior of free random variables, particularly in the analysis of their distributional properties and spectral behaviors, and has found applications in areas such as random matrices, operator algebras, and statistical mechanics.
Boolean independence was introduced in the context of noncommutative probability as an alternative to classical and free independence. It is characterized by the Boolean convolution, which defines the addition of Boolean-independent random variables. The key property of Boolean independence is that mixed moments factorize in a way distinct from classical or free independence. The Boolean independence and the Boolean convolution was introduced in [6] as a fundamental operation in noncommutative probability. The combinatorial structure was explored using moment–cumulant relations and connections to free probability. For a deeper perspective, the authors of [7] expanded on this framework by studying Boolean cumulants. Further results on the Boolean convolution can be found in [8,9,10]. These works laid the foundation for Boolean probability theory, influencing later developments in noncommutative probability.
Both free and Boolean multiplicative convolutions expand our understanding of convolution operations by adapting them to noncommutative probability settings. The free multiplicative convolution provides a framework for exploring the correlations between free random variables, while the Boolean multiplicative convolution offers a means of analyzing the dependencies between Boolean-valued random variables. Together, these operations highlight the versatility and depth of noncommutative probability theory, revealing novel insights into the behavior of systems with complex dependence structures.
This article delves into some properties of free and Boolean multiplicative convolutions, in connection with the recently introduced theory of Cauchy–Stieltjes kernel (CSK) families in the setting of free probability. To better present the outcomes to be proven in this study, we first present some basic concepts around free and Boolean multiplicative convolutions and also some preliminaries on CSK families. P ( P + , respectively) denotes the set of (non-degenerate) probabilities on R ( R + , respectively). For σ P , the Cauchy transform G σ ( · ) is given by
G σ ( z ) = σ ( d ξ ) z ξ , z C supp ( σ )
and the free cumulant transform of σ , denoted R σ ( · ) , is given by [11]
R σ ( G σ ( z ) ) = z 1 / G σ ( z ) , z close to .
For τ P + , ( τ δ 0 ) , the S -transform is introduced by the relation
R τ ( w S τ ( w ) ) = 1 S τ ( w ) w in a neighborhood of  0 .
The operation of free multiplicative convolution ϱ τ of ϱ and τ P + is defined by S ϱ τ ( w ) = S ϱ ( w ) S τ ( w ) . Free multiplicative convolution powers τ γ are defined at least ∀ γ 1 (see Theorem 2.17, [3]) by S τ γ ( w ) = S τ ( w ) γ .
We now introduce the notion of Boolean multiplicative convolution [12]. For τ P + , consider
Ψ τ ( β ) = 0 + β y 1 β y τ ( d y ) , β C R + .
For τ P + , consider the η -transform [13]:
η τ : C R + C R + β η τ ( β ) = Ψ τ ( β ) 1 + Ψ τ ( β ) .
The transform
B τ ( β ) = β η τ ( β )
is defined for β C R + . The multiplicative Boolean convolution ϱ τ  of ϱ and τ P + is defined by the relation
B ϱ τ ( β ) = B ϱ ( β ) B τ ( β ) , β C R +
For ϱ , τ P + verifies the following:
(i)
arg ( η ϱ ( β ) ) + arg ( η τ ( β ) ) arg ( β ) < π β ( , 0 ) C + ;
(ii)
One of the measures ϱ or τ (at least) has a finite first moment.
So, ϱ τ P + is well defined. It was demonstrated in [12] that the operation τ κ P + is defined for κ ∈ [0, 1].
On the other hand, within the framework of noncommutative probability, the theory of CSK families has recently been defined. These families of probability measures are defined in a manner similar to natural exponential families (NEFs), but with the Cauchy–Stieltjes kernel 1 1 ϑ s replacing the exponential kernel exp ( ϑ s ) . The CSK families (called also free exponential families) were examined in [14] for compactly supported measures. In [15,16,17,18], the authors extended the study of CSK families to include measures with support bounded on one side (for example, from above). P b a (respectively, P c ) refers to a subset of non-degenerate probability measures having support bounded from above (respectively, having compact support).
Let ρ P b a . Then,
M ρ ( ϑ ) = ρ ( d l ) 1 ϑ l
is defined for 0 < ϑ < ϑ + ρ were 1 ϑ + ρ = max { 0 , sup supp ( ρ ) } . The family
K + ( ρ ) = P ϑ ρ ( d l ) = ρ ( d l ) M ρ ( ϑ ) ( 1 ϑ l ) : 0 < ϑ < ϑ + ρ
is said to be the CSK family generated by ρ .
The application ϑ k ρ ( ϑ ) = l P ϑ ρ ( d l ) is bijective from ( 0 , ϑ + ρ ) to k μ ( ( 0 , ϑ + ρ ) ) = ( m 0 ρ , m + ρ ) , which is the mean domain of K + ( ρ ) ; see (pp. 579–580, [15]). We then obtain the re-parametrization with the mean of K + ( ρ ) : The inverse of k ρ ( · ) is represented by ψ ρ ( · ) . For m 0 ρ < m < m + ρ , denote Q m ρ ( d l ) = P ψ ρ ( m ) ρ ( d l ) . Then,
K + ( ρ ) = { Q m ρ ( d l ) : m 0 ρ < m < m + ρ } .
It is proved in Proposition 3.4 [15] that m 0 ρ = lim ϑ 0 + k ρ ( ϑ ) and m + ρ = B ρ lim z B ρ + 1 G ρ ( z ) , where B ρ = 1 ϑ + ρ .
The CSK family is represented by K ( ρ ) if the support of ρ is bounded from below. The family K ( ρ ) is defined analogously to K + ( ρ ) except with negative values of ϑ , that is, ϑ ( ϑ ρ , 0 ) , where ϑ ρ can either be 1 / A ρ or , with A ρ = min { 0 , inf supp ( ρ ) } . The mean domain for K ( ρ ) is given by ( m ρ , m 0 ρ ) , where m ρ = A ρ 1 / G ρ ( A ρ ) . If ρ P + . Then, A ρ = 0 , and so
m ρ = 0 1 / G ρ ( 0 ) = [ 0 , + ) 1 l ρ ( d l ) 1 ,
so that 0 < m ρ m 0 ρ . If ρ P c , then ϑ ρ < ϑ < ϑ + ρ , and K ( ρ ) = K ( ρ ) { ρ } K + ( ρ ) is the two-sided CSK family.
Let ρ P b a with a finite first moment m 0 ρ = l ρ ( d l ) . The variance function (VF) parameterizes the variance in terms of the mean. It is defined by (see ([14], Equation (2.5)))
m V ρ ( m ) = ( l m ) 2 Q m ρ ( d l ) .
If the first moment of ρ does not exists, then in K + ( ρ ) , all measures have infinite variance. In Definition 3.1, [15], the pseudo-variance function (PVF) V ρ ( · ) is presented as a substitute. The results proved in this paper are based on expanding the S -transform (or the B -transform) as we will see in the next section. For this reason, we consider measure ρ with a finite first moment, which ensures the existence of the VF. So, there is no need to introduce the concept of the PVF in this paper.
Now, let us introduce the objective of this article in more detail: Consider K ( μ ) = { Q m μ ( d s ) : m ( m μ , m 0 μ ) } as the CSK family induced by a (non-degenerate) μ P + with a finite first moment m 0 μ . For γ > 1 , introduce a novel set of probabilities:
K ( μ ) γ = Q m μ γ ( d s ) : m ( m μ , m 0 μ ) .
In Theorem 1, we prove that if K ( μ ) γ is a re-parametrization of K ( μ ) , then μ is characterized by its corresponding VF V μ ( m ) = c m 2 ln ( m ) , with c > 0 . We also prove that if K ( μ ) γ is a re-parametrization of K ( D 1 / γ ( μ γ ) ) (where ⊞ is the additive free convolution and D a ( μ ) represents the dilation of a measure μ by a number a 0 ), then the measure μ is characterized by its corresponding VF V μ ( m ) = c 1 ( m ln ( m ) ) 2 , with c 1 > 0 . Similar results are obtained in Theorem 2 if we replace in (1) the free multiplicative convolution ⊠ with the Boolean multiplicative convolution ⨃. This will yield a new property for the Marchenko–Pastur law as we will see in Theorem 2(ii).
The following remark concludes this part by presenting some helpful information that supports the major findings of this article.
Remark 1.
Let μ P b a with finite first moment m 0 μ .
(i) 
The CSK families are different from NEFs in the fact that we can recover the generating measure μ without knowing the mean domain. According to Theorem 3.1 [14], the generating measure μ is characterized by V μ ( · ) and m 0 μ : Denote Δ = Δ ( m ) = m + V μ ( m ) m m 0 μ , then
G μ ( Δ ) = m m 0 μ V μ ( m ) .
(ii) 
Consider f : s ι s + υ , where ι 0 and υ R . For m close sufficiently to m 0 f ( μ ) = f ( m 0 μ ) = ι m 0 μ + υ ,
V f ( μ ) ( m ) = ι 2 V μ m υ ι .
See Section 3.3 [15] for more details.
(iii) 
The Marchenko–Pastur law is provided by
MP a ( d s ) = ( a + 1 ) 2 s s ( a 1 ) 2 2 π a 2 s 1 ( a 1 ) 2 , ( a + 1 ) 2 ( s ) d s + ( 1 1 / a 2 ) + δ 0
for a 0 , with m 0 MP a = 1 . We have V MP a ( m ) = a 2 m .

2. Main Results

We present some properties related to free and Boolean multiplicative convolutions. The following finding is related to free multiplicative convolution.
Theorem 1.
Let ρ P + with a finite first moment m 0 ρ . For γ > 1 , consider the family of probability measures K ( ρ ) γ defined by (1).
(i) 
Assume that r ( m ρ , m 0 ρ ) , there is p = p ( r , γ ) ( m ρ , m 0 ρ ) so that Q r ρ = Q p ρ γ . Then, p = r 1 / γ , and ρ is characterized by its corresponding VF given by
V ρ ( r ) = c r 2 ln ( r ) , r ( m ρ , m 0 ρ ) , c > 0 .
(ii) 
Assume that r m D 1 / γ ( ρ γ ) , m 0 D 1 / γ ( ρ γ ) , there is a p = p ( r , γ ) ( m ρ , m 0 ρ ) so that Q r D 1 / γ ( ρ γ ) = Q p ρ γ . Then, p = r 1 / γ , and ρ is characterized by its corresponding VF given by
V ρ ( r ) = c 1 ( r ln ( r ) ) 2 , r m D 1 / γ ( ρ γ ) , m 0 D 1 / γ ( ρ γ ) , c 1 > 0 .
Proof. 
(i) Assume that ∀ r ( m ρ , m 0 ρ ) , there is a p = p ( r , γ ) ( m ρ , m 0 ρ ) so that Q r ρ = Q p ρ γ . This implies that
S Q r ρ ( ζ ) = S Q p ρ ( ζ ) γ , ζ close to  0 .
We know from Theorem 3.3 [19] that the S -transform of Q r ρ may be given as
S Q r ρ ( ζ ) = 1 m 0 Q r ρ Var ( Q r ρ ) ( m 0 Q r ρ ) 3 ζ + ζ ε ( ζ ) = 1 r V ρ ( r ) r 3 ζ + ζ ε ( ζ ) , where ε ( ζ ) ζ 0 0 .
Also we have
S Q p ρ ( ζ ) γ = 1 p V ρ ( p ) p 3 ζ + ζ ε ( ζ ) γ = 1 p γ 1 γ V ρ ( p ) p 2 ζ + ζ ε 1 ( ζ ) , where ε 1 ( ζ ) ζ 0 0 .
Combining (5)–(7), we obtain
1 r V ρ ( r ) r 3 ζ + ζ ε ( ζ ) = 1 p γ 1 γ V ρ ( p ) p 2 ζ + ζ ε 1 ( ζ ) .
This implies that p = r 1 / γ , and then,
V ρ ( r ) r 2 = γ V ρ ( r 1 / γ ) r 2 / γ , r ( m ρ , m 0 ρ ) and γ > 1 .
The solution of functional Equation (9) is V ρ ( r ) r 2 = c ln ( r ) , for some c > 0 . This concludes the proof of Theorem 1(i).
(ii) Assume that ∀ r m D 1 / γ ( ρ γ ) , m 0 D 1 / γ ( ρ γ ) , there is a p = p ( r , γ ) ( m ρ , m 0 ρ ) so that Q r D 1 / γ ( ρ γ ) = Q p ρ γ . This implies that
S Q p ρ ( ζ ) γ = S Q r D 1 / γ ( ρ γ ) ( ζ ) , ζ close to  0 .
Based on (6), the S -transform of Q r D 1 / γ ( ρ γ ) may be given as
S Q r D 1 / γ ( ρ γ ) ( ζ ) = 1 m 0 Q r D 1 / γ ( ρ γ ) Var Q r D 1 / γ ( ρ γ ) m 0 Q r D 1 / γ ( ρ γ ) 3 ζ + ζ ε ( ζ ) = 1 r V D 1 / γ ( ρ γ ) ( r ) r 3 ζ + ζ ε ( ζ ) , where ε ( ζ ) ζ 0 0 .
Based on (3) and knowing from [15] that V ρ γ ( r ) = γ V ρ ( r / γ ) , from (11), we have
S Q r D 1 / γ ( ρ γ ) ( ζ ) = 1 r V ρ ( r ) / γ r 3 ζ + ζ ε ( ζ ) , where ε ( ζ ) ζ 0 0 .
Combining (7), (10), and (12), we obtain
1 p γ 1 γ V ρ ( p ) p 2 ζ + ζ ε 1 ( ζ ) = 1 r V ρ ( r ) / γ r 3 ζ + ζ ε ( ζ ) .
This gives that p = r 1 / γ , and so,
V ρ ( r ) r 2 = γ 2 V ρ ( r 1 / γ ) r 2 / γ , r m D 1 / γ ( ρ γ ) , m 0 D 1 / γ ( ρ γ ) and γ > 1 .
The solution of functional Equation (14) is V ρ ( r ) r 2 = c 1 ( ln ( r ) ) 2 , for some c 1 > 0 . This concludes the proof of Theorem 1(ii). □
Remark 2.
Note that, up to affine transformations, we may suppose that ( m ρ , m 0 ρ ) ( 1 , + ) in Theorem 1(i) and m D 1 / γ ( ρ γ ) , m 0 D 1 / γ ( ρ γ ) ( 1 , + ) in Theorem 1(ii).
The following finding is related to Boolean multiplicative convolution.
Theorem 2.
Let  ρ P +  with a finite first moment  m 0 ρ . For  κ ( 0 , 1 ) , consider the family of probability measures
K ( ρ ) κ = { ( Q m ρ ) κ ( d s ) :    m ( m ρ , m 0 ρ ) } .
(i) 
Assume that m ( m ρ , m 0 ρ ) , we have  Q m ρ κ = Q r ρ  for some  r = r m , κ m ρ , m 0 ρ . Then, r = mκ, and ρ is characterized by its corresponding VF given by
V ρ ( m ) = d m ln ( m ) , m ( m ρ , m 0 ρ ) , d > 0 .
(ii) 
Assume that ∀ m ( m ρ , m 0 ρ ) , we have  Q m ρ κ = Q r D κ ( ρ 1 / κ )  for some  r = r ( m , κ ) ( m D κ ( ρ 1 / κ ) , m 0 D κ ( ρ 1 / κ ) ) . Then, r = mκ, and ρ is a Marchenko–Pastur law scaled up.
Proof. 
(i) Assume that ∀ m ( m ρ , m 0 ρ ) , we have Q m ρ κ = Q r ρ  for some  r = r m , κ m ρ , m 0 ρ . This implies that
B Q m ρ ( ζ ) κ = B Q r ρ ( ζ ) , ζ close to  0 .
We know from Equation (24) [20] that
1 B Q r ρ ( ζ ) = r + V ρ ( r ) ζ + ζ ϵ ( ζ ) , where ϵ ( ζ ) ζ 0 0 .
Based on (16), we obtain
1 B Q m ρ ( ζ ) κ = m + V ρ ( m ) ζ + ζ ϵ ( ζ ) κ = m κ 1 + κ V ρ ( m ) m ζ + ζ ϵ 1 ( ζ ) , with ϵ 1 ( ζ ) ζ 0 0 .
Combining (15)–(17), we obtain
r + V ρ ( r ) ζ + ζ ϵ ( ζ ) = m κ 1 + κ V ρ ( m ) m ζ + ζ ϵ 1 ( ζ ) .
This gives that r = m κ , and so,
V ρ ( m κ ) m κ = κ V ρ ( m ) m , m ( m ρ , m 0 ρ ) and κ ( 0 , 1 ) .
The solution of functional Equation (18) is V ρ ( m ) m = d ln ( m ) , for some d > 0 . This concludes the proof of Theorem 2(i).
(ii) Assume that ∀ m ( m ρ , m 0 ρ ) , we have Q m ρ κ = Q r D κ ( ρ 1 / κ ) for some r = r ( m , κ ) ( m D κ ( ρ 1 / κ ) , m 0 D κ ( ρ 1 / κ ) ) . This implies that
B Q m ρ ( ζ ) κ = B Q r D κ ( ρ 1 / κ ) ( ζ ) , ζ close to  0 .
Combining (3) and (16) and knowing from [15] that V ρ 1 / κ ( r ) = V ρ ( κ r ) / κ , we obtain
1 B Q r D κ ( ρ 1 / κ ) ( ζ ) = r + V D κ ( ρ 1 / κ ) ( r ) ζ + ζ ϵ ( ζ ) = r + κ V ρ ( r ) ζ + ζ ϵ ( ζ ) where ϵ ( ζ ) ζ 0 0 .
Combining (17), (19), and (20), we obtain
r + κ V ρ ( r ) ζ + ζ ϵ ( ζ ) = m κ 1 + κ V ρ ( m ) m ζ + ζ ϵ 1 ( ζ ) .
This gives that r = m κ , and so,
V ρ ( m κ ) m κ = V ρ ( m ) m , m ( m ρ , m 0 ρ ) , and κ ( 0 , 1 ) .
The solution of functional Equation (21) is V ρ ( m ) m = d 1 , for some d 1 > 0 . Thus, the measure ρ is a Marchenko–Pastur distribution scaled up. This concludes the proof of Theorem 2(ii). □
Remark 3.
Note that, up to affine transformations, we may suppose in Theorem 2(i) that ( m ρ , m 0 ρ ) ( 1 , + ) .

3. Conclusions

This paper studies the relationship of CSK families with multiplicative (free and Boolean) convolutions. Let ρ P + with a finite first moment m 0 ρ . For κ ( 0 , 1 ) , we considered a new family of probability measures
K ( ρ ) κ = { ( Q m ρ ) κ ( d s ) :    m ( m ρ , m 0 ρ ) } .
We proved that if K ( ρ ) κ is a re-parametrization of K ( ρ ) then ρ is characterized by its corresponding VF V ρ m = d m   ln m ,   m m ρ , m 0 ρ ,   d > 0 . We also proved that if K ( ρ ) κ is a re-parametrization of K D κ ρ 1 / κ , then ρ is a Marchenko–Pastur measure scaled up. Similar results are obtained if we replace the Boolean multiplicative convolution ⨃ with the free multiplicative convolution ⊠. The study of CSK families in relation to free and Boolean multiplicative convolutions provides a powerful analytic framework for understanding fundamental objects in noncommutative probability. It helps unify different independence structures, aids in explicit calculations, and connects probability theory with deep areas of complex analysis and functional analysis. The study of invariance properties of CSK families under free and Boolean multiplicative convolutions provides a deep structural understanding of noncommutative probability and free harmonic analysis. It helps classify fundamental distributions, connects probability with functional analysis, and reveals rich algebraic and analytic structures underlying multiplicative convolutions.

Author Contributions

Validation, F.A. (Fatimah Alshahrani); investigation, F.A. (Fahad Alsharari); formal analysis, F.A. (Fatimah Alshahrani); resources, F.A. (Fahad Alsharari); data curation, R.F.; methodology, R.F.; writing—original draft, R.F.; visualization, F.A. (Fahad Alsharari); writing—review and editing, R.F.; project administration, F.A. (Fatimah Alshahrani); conceptualization, F.A. (Fahad Alsharari); funding acquisition, F.A. (Fatimah Alshahrani). All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2025R358), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Data Availability Statement

No new data were created or analyzed in this study.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Voiculescu, D. Addition of certain non-commuting random variables. J. Funct. Anal. 1986, 66, 323–346. [Google Scholar] [CrossRef]
  2. Belinschi, S.T.; Nica, A. On a remarkable semigroup of homomorphisms with respect to free multiplicative convolution. Indiana Univ. Math. J. 2008, 57, 1679–1713. [Google Scholar] [CrossRef]
  3. Belinschi, S.T. Complex Analysis Methods in Noncommutative Probability; University of Michigan, ProQuest LLC: Ann Arbor, MI, USA, 2005. [Google Scholar]
  4. Bercovici, H.; Pata, V. Stable laws and domains of attraction in free probability theory (with an appendix by Philippe Biane). Ann. Math. 1999, 149, 1023–1060. [Google Scholar] [CrossRef]
  5. Bercovici, H.; Voiculescu, D. Lévy-Hincin type theorems for multiplicative and additive free convolution. Pacific J. Math. 1992, 153, 217–248. [Google Scholar] [CrossRef]
  6. Speicher, R.; Woroudi, R. Boolean convolution. Fields Inst. Commun. 1997, 12, 267–279. [Google Scholar]
  7. Krawczyk, B.; Speicher, R. Combinatorics of Free Cumulants. J. Comb. Theory Ser. A 2000, 90, 267–292. [Google Scholar] [CrossRef]
  8. Salazar, M. On a Berry-Esseen type limit theorem for Boolean convolution. Electron. Commun. Probab. 2022, 27, 1–10. [Google Scholar] [CrossRef]
  9. Arizmendi, O.; Salazar, M. A Berry-Esseen type limit theorem for Boolean convolution. Arch. Math. 2018, 111, 101–111. [Google Scholar] [CrossRef]
  10. Chakraborty, S.; Hazra, R.S. Boolean convolutions and regular variation. Lat. Am. J. Probab. Math. Stat. 2018, 15, 961–991. [Google Scholar] [CrossRef]
  11. Bercovici, H.; Voiculescu, D. Free convolution of measures with unbounded support. Indiana Univ. Math. J. 1993, 42, 733–773. [Google Scholar] [CrossRef]
  12. Bercovici, H. On Boolean convolutions. Oper. Theory 2006, 20, 7–13. [Google Scholar]
  13. Anshelevich, M.; Wang, J.-C.; Zhong, P. Local limit theorems for multiplicative free convolutions. J. Funct. Anal 2014, 267, 3469–3499. [Google Scholar] [CrossRef]
  14. Bryc, W. Free exponential families as kernel families. Demonstr. Math. 2009, 42, 657–672. [Google Scholar] [CrossRef]
  15. Bryc, W.; Hassairi, A. One-sided Cauchy-Stieltjes kernel families. J. Theor. Probab. 2011, 24, 577–594. [Google Scholar] [CrossRef]
  16. Fakhfakh, R. Some Results in Cauchy-Stieltjes Kernel Families. Filomat 2022, 36, 869–880. [Google Scholar] [CrossRef]
  17. Fakhfakh, R. A characterization of the Marchenko-Pastur probability measure. Stat. Probab. Lett. 2022, 191, 109660. [Google Scholar] [CrossRef]
  18. Fakhfakh, R.; Hassairi, A. Cauchy-Stieltjes kernel families and free multiplicative convolution. Commun. Math. Stat. 2023, 12, 679–694. [Google Scholar] [CrossRef]
  19. Noriyoshi, S.; Hiroaki, Y. New limit theorems related to free multiplicative convolution. Stud. Math. 2013, 214, 251–264. [Google Scholar]
  20. Alanzi, A.R.A.; Alshqaq, S.S.; Fakhfakh, R. Stability of Cauchy—Stieltjes Kernel Families by Free and Boolean Convolutions Product. Mathematics 2024, 12, 3465. [Google Scholar] [CrossRef]
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.

Share and Cite

MDPI and ACS Style

Alsharari, F.; Fakhfakh, R.; Alshahrani, F. Invariance Property of Cauchy–Stieltjes Kernel Families Under Free and Boolean Multiplicative Convolutions. Mathematics 2025, 13, 1044. https://doi.org/10.3390/math13071044

AMA Style

Alsharari F, Fakhfakh R, Alshahrani F. Invariance Property of Cauchy–Stieltjes Kernel Families Under Free and Boolean Multiplicative Convolutions. Mathematics. 2025; 13(7):1044. https://doi.org/10.3390/math13071044

Chicago/Turabian Style

Alsharari, Fahad, Raouf Fakhfakh, and Fatimah Alshahrani. 2025. "Invariance Property of Cauchy–Stieltjes Kernel Families Under Free and Boolean Multiplicative Convolutions" Mathematics 13, no. 7: 1044. https://doi.org/10.3390/math13071044

APA Style

Alsharari, F., Fakhfakh, R., & Alshahrani, F. (2025). Invariance Property of Cauchy–Stieltjes Kernel Families Under Free and Boolean Multiplicative Convolutions. Mathematics, 13(7), 1044. https://doi.org/10.3390/math13071044

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop