Home Constructing models for spherical and elliptical densities
Article Open Access

Constructing models for spherical and elliptical densities

  • Eckhard Liebscher EMAIL logo
Published/Copyright: December 31, 2023
Become an author with De Gruyter Brill

Abstract

The article provides construction algorithms for consistent model classes of continuous spherical and elliptical distributions. The algorithms are based on characterization theorems for consistent families of generator functions. This characterization uses the term of complete monotonicity. The algorithms are applied to several examples of generators leading to consistent families of generators with explicit formulas for marginal densities of arbitrary dimension.

MSC 2010: 60E99; 62H99

1 Introduction

Apart from copulas, elliptically contoured distributions (abbreviated: elliptical distributions) play an important role in modelling multivariate distributions. Models for elliptical distributions are applied in various fields, such as finance (see McNeil et al. [13], for example), ecological science, econometry, engineering, and other disciplines. The classical theory is presented in the popular textbooks by Anderson [2], Fang and Zhang [6], and Fang et al. [5]. Fundamental properties of elliptical distributions were published in the papers by Kelker [9], Cambanis et al. [3], and Kano [8], among others. Kano [8] introduced the term of consistent spherical distributions. Since the publication of the Kano article, it is an open problem whether there are principles for constructing consistent families of spherical distributions. Based on such a family, a corresponding family of elliptical distributions can be established. In this article, we show that the consistency of families of spherical distributions is closely related with complete monotonicity of generator functions. Contrary to most of the other papers, we define the continuous elliptical distribution by use of the density instead of characteristic functions.

Parametric estimation problems in the context of elliptical distributions were examined by a series of authors, for example, see the studies by Maruyama and Seo [12] and Srivastava and Bilodeau [17]. Semiparametric estimators for elliptical distributions were considered in the paper by Liebscher [10], where the generator function is estimated by a kernel estimator.

The classes of distributions that we focus on in this article are introduced next.

DEFINITIONS: A p -dimensional random vector X follows a continuous spherical distribution SC p ( g p ) if its density function exists and is given by g p ( t T t ) for t R p with a function g p : [ 0 , ) [ 0 , ) . We write X SC p ( g p ) .

Function g p is referred to as a density generator for dimension p if g p is non-negative, and fulfills

(1.1) 0 r p 2 1 g p ( r ) d r = Γ ( p 2 ) π p 2 = s p 1 for p 1 .

A random vector Y R p has a continuous elliptical distribution (of full rank) with parameters μ R p and Σ R p , p , rank ( Σ ) = p , if Y has the same distribution as μ + A T Z , where Z SC p ( g p ) and A R p , p is a matrix such that A T A = Σ . In symbols Y EC p ( μ ; Σ ; g p ) .

For the density f Y of Y , we have

(1.2) f Y ( y ) = Σ 1 2 g p ( ( y μ ) T Σ 1 ( y μ ) )

for y R p . Let s p = π p 2 Γ ( p 2 ) . Condition (1.1) ensures that t g p ( t T t ) ( t R p ) and f Y according to (1.2) represent a density. Next, we provide the theorems about the representation of spherical and elliptical random vectors.

Theorem 1.1

Let X SC p ( g p ) and U be a random vector having uniform distribution on the (p-1)-dimensional unit sphere. Then we have

(1.3) X = d R U ,

where R = X is a real non-negative random variable independent of U. The symbol = d means equality of the distributions. Moreover, R has the density

(1.4) h p ( r ) = 2 π p 2 Γ ( p 2 ) r p 1 g p ( r 2 ) ( r 0 ) .

From (1.4), it follows that

(1.5) f R 2 ( r ) = π p 2 Γ ( p 2 ) r p 2 1 g p ( r )

is the density of R 2 , where R is the random radius in (1.3). Considering specific families of generator functions, this formula will be used in the generation of spherical random variates according to Equation (1.3). Theorem 1.2 is a consequence of Theorem 1.1 (cf. [6], Corollary 1 to Theorem 2.6.1):

Theorem 1.2

Let Y EC p ( μ ; Σ ; g p ) with rank ( Σ ) = p . Assume that U is a random vector having uniform distribution on the (p-1)-dimensional unit sphere. Then

Y = d μ + R A U

holds, where R is a real non-negative random variable independent of U and having density (1.4), Σ = A T A holds for a matrix A R p , p .

Unfortunately, the parametrization ( μ ; Σ ; g p ) of EC p densities is not unique. This is stated in Theorem 1.3 (cf. [6], Theorem 2.6.2):

Theorem 1.3

Suppose that Y EC p ( μ ; Σ ; g p ) and Y EC p ( μ ; Σ ; g p ) . Then there is a constant c > 0 , such that

μ = μ , Σ = c Σ , g p ( z ) = c p 2 g p ( c z ) for a l m o s t e v e r y z R .

Theorem 1.3 is the reason that we do not consider the scale parametrization of g p .

In this article, the aim is to provide classes of continuous spherical and elliptical distributions with explicit formulas for marginal densities of arbitrary dimension. We are interested in consistent families of generators for random vectors X SC p ( g p ) , where every marginal distribution of X of dimension m is distributed as SC m ( h ) and h also belongs to the consistent family. We search for an algorithm by which, starting from g 1 , a family { g p } p 1 of density generators can be derived. Here, ideas of Kano’s [8] paper are utilized. In Section 2, we study the properties of consistent families of generator functions. Section 3 is devoted to the construction of families. The random number generation of spherically distributed vectors is briefly discussed in Section 4. A survey of consistent families of elliptical distributions with explicit formulas can be found in Sections 5 and 6. Section 7 presents the proofs of the presented theorems.

2 Characterization of consistent generator families

In this section, we consider a family of non-negative functions { g p } p I , where I = { 1 , 2 , , p 0 } , p 0 3 , or I = { 1 , 2 , } = N , i.e., p 0 = . We call a family { g p } p I of density generators consistent if

(2.1) g p ( z 1 2 + + z p 2 ) = g p + 1 ( z 1 2 + + z p + 1 2 ) d z p + 1 = 2 0 g p + 1 ( z 1 2 + + z p 2 + t 2 ) d t

for all z 1 , , z p R , 1 p < p 0 . The notion of consistency goes back to Kano [8]. Now we give the most important statements of Kano’s paper.

Theorem 2.1

[8], Theorem 1: (a) The family { g p } p I of density generators is consistent if and only if

(2.2) g p ( r ) = 2 0 g p + 1 ( r + t 2 ) d t = r 1 y r g p + 1 ( y ) d y

for r 0 , 1 p < p 0 .

(b) Let { g p } p 1 be an infinite family of density generators. This family is consistent if and only if there exists a random variable ξ > 0 with distribution function F 0 , unrelated to p, such that for p 1 ,

X p = d 1 ξ Z p ,

where X p has density t g p ( t T t ) , Z p is a p-dimensional standard normal random vector, Z p and ξ are independent, and

(2.3) g p ( r ) = 0 t 2 π p 2 e r t 2 d F 0 ( t )

for almost all r 0 .

Equation (2.3) can be interpreted in a manner that allows g p to be represented as a Laplace-Stieltjes transform:

g p ( r ) = 0 t π p 2 e r t d F 0 ( 2 t ) = 0 e r t d F ˜ p ( t ) ,

where F ˜ p ( t ) = 0 t ( s π ) p 2 d F 0 ( 2 s ) . Unfortunately, in many cases, F 0 and F ˜ p are not of explicit form. If F 0 has a density, then it is denoted by f 0 . In this case, the function t 1 ( g p ) ( t ) = 2 t π p 2 f 0 ( 2 t ) is the inverse Laplace transform of g p , which implies

(2.4) f 0 ( t ) = 1 ( g p ) ( t 2 ) 2 p 2 1 π p 2 t p 2 ( t 0 ) .

The following Proposition 2.2 provides a formula for the marginal densities of spherical distributions. This statement follows directly from (2.1).

Proposition 2.2

Let { g p } p I be a consistent family of density generators. We consider a p-dimensional random vector X with continuous spherical distribution SC p ( g p ) .

Then z g q ( z 1 2 + + z q 2 ) ( z = ( z 1 , , z q ) T R q ) is the q-dimensional marginal density of X for q < p .

3 Construction of consistent density generators

Consistent families are connected with completely monotonic functions on [ 0 , ) (cf. [11]):

DEFINITION: A function f : [ 0 , ) [ 0 , ) is completely monotonic if all derivatives exists on [ 0 , ) and

( 1 ) n f ( n ) ( x ) 0 for x 0 , n = 1 , 2 ,

The Bernstein-Widder theorem (cf. [11], Theorem A) gives an important assertion about the characterization of completely monotonic functions:

Theorem 3.1

The function f is completely monotonic on [ 0 , ) if and only if

f ( x ) = 0 e x t d F ( t ) ( x 0 )

with a suitable function F : [ 0 , ) R , which is bounded and non-decreasing.

The central idea in this section is to determine the function g 1 and to provide evaluation formulas for the other generators { g p } p 2 to obtain a consistent family. The following Theorem 3.2 provides an equivalent characterization of families of functions satisfying the consistency condition (2.2) in the case of an infinite family { g p } with p 0 = .

Theorem 3.2

Suppose that lim r g 1 ( r ) = 0 . Then the family { g p } p 1 of functions g p : [ 0 , ) [ 0 , ) fulfills (2.2)for p 1 , and g p ( 0 ) = lim u 0 + g p ( u ) < + for p 1 if and only if

g 1 : [ 0 , ) [ 0 , ) is completely monotonic on [ 0 , ) , the functions g p ( p 1 ) are differentiable on [ 0 , ) and the following two conditions are satisfied:

(3.1) g p + 2 ( r ) = 1 π g p ( r ) ,

for p 1 , r 0 and

(3.2) g 2 ( r ) = 2 0 g 3 ( r + y 2 ) d y ( r 0 ) .

Furthermore, an equation describing the relation between g p and g p + 1 can be established using fractional derivatives:

Proposition 3.3

Assume that g 1 : [ 0 , ) [ 0 , ) is completely monotonic on [ 0 , ) with lim r g 1 ( r ) = 0 , and { g p } p 1 is a family of functions g p : [ 0 , ) [ 0 , ) satisfying (2.2) and g p ( 0 + ) < + for p 1 . Then

( g p ( u ) ) ( 1 2 ) = π g p + 1 ( u ) ( u 0 , p 1 ) ,

where the derivative of half order is meant with respect to u, and it is a fractional derivative in the sense of Caputo, see the definition in the Appendix.

Considering the construction of elliptical densities, functions g p have to satisfy the additional condition (1.1). Theorem 3.4 contains the corresponding statement.

Theorem 3.4

Let { g p } p I be a family of functions.

In the case p 0 = , suppose that g 1 : [ 0 , ) [ 0 , ) is completely monotonic on [ 0 , ) .

In the case p 0 < , assume that { g p } p I is a finite family of non-negative functions on [ 0 , ) with g p ( 0 ) = g p ( 0 + ) < + for p I , and g 1 , , g p 0 2 are differentiable.

Further assume that identities lim r g 1 ( r ) = 0 , (3.1) for p + 2 p 0 , and (3.2) are fulfilled. Let

(3.3) 0 r 1 2 g 1 ( r ) d r = 1

be satisfied. Then { g p } p 1 is a consistent family of density generators.

On the basis of Theorem 3.4, we can provide algorithms for the construction of functions g p .

Algorithm for infinite p 0 ̲

  1. Choose a completely monotonic function g 1 with g 1 ( 0 + ) < + , (3.3) and lim r g 1 ( r ) = 0 .

  2. Evaluate g 3 ( r ) = 1 π g 1 ( r ) .

  3. Evaluate g 2 ( r ) = 2 0 g 3 ( r + y 2 ) d y .

  4. For k = 1 , 2 , , do.

    g 2 k + 2 ( r ) = 1 π g 2 k ( r ) , g 2 k + 3 ( r ) = 1 π g 2 k + 1 ( r ) .

Algorithm for finite p 0 ̲
  1. Choose a non-negative differentiable function g 1 with g 1 ( 0 + ) < + , (3.3) and lim r g 1 ( r ) = 0 .

  2. Evaluate g 3 ( r ) = 1 π g 1 ( r ) and check g 3 ( r ) 0 for r 0 .

  3. Evaluate g 2 ( r ) = 2 0 g 3 ( r + y 2 ) d y and check g 2 ( r ) 0 for r 0 .

  4. For k = 1 , 2 , , ( p 0 3 ) 2 , do

    g 2 k + 2 ( r ) = 1 π g 2 k ( r ) , g 2 k + 3 ( r ) = 1 π g 2 k + 1 ( r ) ,

    and check g 2 k + 2 ( r ) , g 2 k + 3 ( r ) 0 for r 0 .

At first glance, it seems that for finite p 0 , more checks are required in the algorithms than in the infinite case. Here, it should be noticed that completely monotonicity of g 1 has a lot of consequences under (3.1) and (3.2): g p is completely monotonic and g p ( r ) 0 in view of Lemma 7.2, g p ( 0 ) = g p ( 0 + ) < + , and g p ( r ) 0 for r 0 . The remarks on page 2 of the study by Miller and Samko [14] show that completely monotonic functions on [ 0 , ) cannot vanish on an interval and are strictly positive on [ 0 , ) . Therefore, in the case p 0 = , the density generators from the aforementioned algorithm are strictly positive on [ 0 , ) .

Now we consider the problem of how to obtain other consistent families from two given families. One approach is to deal with mixtures of scale transformed generators.

Proposition 3.5

Let { g p } p I and { h p } p I be consistent families of density generators. Then the family { g ¯ p } p 1 defined by

g ¯ p ( r ) = q g p ( r ) + ( 1 q ) h p ( r ) ( r 0 )

for q [ 0 , 1 ] is consistent, too.

In this proposition, a special case is given by h p ( r ) = a p 2 g p ( a r ) , where a > 0 is a parameter. The proof can be done in a straightforward way.

4 Random number generation

Theorems 1.1 and 1.2 can be used for the generation of spherical or elliptical distributions. Now we show how to generate X SC d ( g d ) .

Algorithm ̲

  1. Generate V N ( 0 , I ) deploying standard algorithms, e.g., the Box-Muller method

  2. U = 1 V V

  3. Generate R having density according to (1.4)

  4. X = R U

Variable V contains independently standard normally distributed components. The formula in step 2 can be used since U has the uniform distribution on the p -dimensional unit sphere and U is independent of g p and parameters.

5 Models for consistent generator functions on the infinite interval [ 0 , )

In the following, we do not consider scale parameters for the generator families because they are taken into account in the definition of elliptical densities. Moreover, the normalizing constants are chosen such that (3.3) is satisfied. All computations were done by the computer algebra system (CAS) Mathematica. Let R p denote the random radius of a p -dimensional spherical random vector. The Appendix contains figures of a couple of the generator functions of this section.

5.1 Normal distribution generator

The density generator is given by

g p ( r ) = 1 ( 2 π ) p 2 exp r 2 ( r 0 ) .

For the density f R 2 of R p 2 , we obtain

f R 2 ( r ) = 1 2 p 2 Γ ( p 2 ) r p 2 1 exp r 2 ( r 0 )

in view of (1.5). Here, f R 2 is the χ p 2 density. The density of the one-dimensional marginal distribution is the standard normal one.

5.2 Normal mixture generator

We introduce the normal mixture model with parameters q [ 0 , 1 ] and a > 0 , a 1 as follows:

g p ( r ) = 1 ( 2 π ) p 2 q a p 2 exp a r 2 + ( 1 q ) exp r 2 ( r 0 ) ,

where q is the mixture fraction. Here, R p 2 is a mixture of W 1 Γ ( p 2 , 2 a ) and W 2 Γ ( p 2 , 2 ) with mixture fraction q .

5.3 t -distribution (Pearson VII) generator

The generator function for the multivariate t 2 m -distribution with parameter m > 0 is given by (cf. [6], p.71, Example 2.6.2)

g p ( r ) = Γ ( p 2 + m ) ( 2 m ) p 2 π p 2 Γ ( m ) 1 + r 2 m p 2 m ( r 0 ) .

For the density of W = 1 2 m R p 2 , we obtain

f W ( r ) = Γ ( p 2 + m ) Γ ( p 2 ) Γ ( m ) r p 2 1 ( 1 + r ) p 2 m ( r 0 ) ,

which is the density of a beta-prime distribution with parameters p 2 and m (also called compound beta distribution, cf. [4]). The one-dimensional marginal density is just the t 2 m density.

5.4 Difference of powers

Here, we consider the difference of Pearson VII generators defined by ( m > 0 , a > 1 , 0 < c 1 )

(5.1) g p ( r ) = ( ( r + 1 ) m p 2 c ( r + a ) m p 2 ) γ a , m , c , p

for r 0 , p 1 , where

γ a , m , c , p = Γ ( m + p 2 ) π p 2 Γ ( m ) ( 1 c a m ) .

The consistency of this generator is proved in Lemma 7.4. We evaluate the inverse Laplace transform of g p :

t e t c e a t Γ ( m ) ( 1 c a m ) π p 2 t 1 + m + p 2 ,

which implies a formula for the density f 0 of F 0 by (2.4):

f 0 ( t ) = e t 2 c e a t 2 2 m Γ ( m ) ( 1 c a m ) t m 1

for t 0 . This formula could be the basis for the generation of spherical random variables X SC p ( g p ) , g p as in (5.1) using Theorem 2.1b.

5.5 Logarithmic generator I

We introduce the generator function g 1 with parameter a > 1 , b > 0 , b a 1 :

(5.2) g 1 ( r ) = b ln ( r + a ) 2 π ln ( a + b ) ( r + b )

for r 0 . In the cases p = 2 , 3 , we obtain

g 2 ( r ) = b 2 π ln ( a + b ) × 1 r + a ( r + b ) + ln ( a + r + r + b ) ( r + b ) 3 2 , and g 3 ( r ) = b 2 π 2 ln ( a + b ) 1 ( r + a ) ( r + b ) + ln ( r + a ) ( r + b ) 2

for r 0 . The generator functions g p , p > 3 can be derived from these formulas. In Lemma 7.5, it is proven that the resulting family { g p } p 1 of generators is consistent.

5.6 Logarithmic generator II

Here, we consider a modification of the logarithmic generator I:

g 1 ( r ) = 1 2 π r ln ( 1 + r ) , g 2 ( r ) = 1 2 π 1 r 2 ( r + 1 ) + 2 r 3 2 ln ( r + r + 1 ) , g 3 ( r ) = r + ( r + 1 ) ln ( r + 1 ) 2 π 2 r 2 ( r + 1 )

for r 0 . Analogously to Lemma 7.5, one can show that the resulting family { g p } p 1 of generators is consistent.

5.7 Logarithmic generator III

We introduce the generator function g 1 with parameters a , c > 0 :

g 1 ( r ) = ln ( 1 + c ( r + a ) 1 ) 2 π ( a + c a )

for r 0 . Function g 1 is completely monotonic according to formula (1.2) in [14]. Condition (3.3) is fulfilled. In the cases p = 2 , 3 , we obtain

g 2 ( r ) = a + c + a 2 π ( r + a ) ( r + a + c ) ( r + a + r + a + c ) , and g 3 ( r ) = a + c + a 2 π 2 ( r + a ) ( r + a + c )

for r 0 . We obtain the other generator functions by using (3.1). The inverse Laplace transform of g 1 can be evaluated and gives

t e a t e ( a + c ) t 2 π ( a + c a ) t .

Hence,

f 0 ( t ) = e a t 2 e ( a + c ) t 2 2 π ( a + c a ) t 3 2

holds for s 0 .

5.8 Fractional-exponential generator

The generator function g 1 with parameter a > 0 is introduced as follows:

(5.3) g 1 ( r ) = e a r a ( r + a ) erfc ( a ) π ,

where erfc ( z ) = 2 π z e x 2 d x is the complementary error function. Further, we have

g 2 ( r ) = a π 3 2 erfc ( a ) e a r r + a + π erfc ( r + a ) 2 ( r + a ) 3 2 , g 3 ( r ) = ( r + 1 + a ) e a r a ( r + a ) 2 erfc ( a ) π 2 .

We show in Lemma 7.8 that the resulting family { g p } p 1 is consistent. By using identity (2.4) for p = 1 , we obtain the density f 0 as follows:

f 0 ( t ) = e a t 2 a H t 2 1 2 π t erfc ( a ) ,

where H ( t ) = 1 for t 0 , and H ( t ) = 0 for t < 0 . This implies

g p ( r ) = a Γ ¯ p + 1 2 , a + r erfc ( a ) π ( p + 1 ) 2 ( a + r ) ( p + 1 ) 2 ,

where Γ ¯ ( b , z ) = z x b 1 e x d x is the incomplete gamma function.

5.9 Difference-exponential distribution

We introduce the generator function g 1 with parameter a > 1 :

(5.4) g 1 ( r ) = e r e a r r 2 ( a 1 ) π

for r 0 . Obviously, the equation

1 a e r t d t = e r e a r r

holds true, and therefore, by the Bernstein-Widder Theorem 3.1, g 1 has an inverse Laplace transform and is completely monotonic. Further, we obtain

g 3 ( r ) = e r ( 1 + r ) e a r ( 1 + a r ) 2 r 2 ( a 1 ) π 3 , g 2 ( r ) = 2 e r r 2 e a r a r + π ( 2 Φ ( 2 r ) + 2 Φ ( 2 a r ) ) 4 r 3 2 ( a 1 ) π ,

where Φ is the distribution function of the standard normal distribution. By identity (2.4) for p = 1 , we can derive a formula for the density f 0 (function H as mentioned earlier):

f 0 ( t ) = H t 2 1 H t 2 a 8 t ( a 1 ) .

For g p , we obtain

g p ( r ) = Γ ¯ p + 1 2 , r Γ ¯ p + 1 2 , a r r ( p + 1 ) 2 2 ( a 1 ) π p 2 .

By means of a CAS, it is shown that identities (3.1)–(3.3) hold true. Then { g p } p 1 is a consistent family of density generators in view of Theorem 3.4.

5.10 Polylogarithmic generator

The family of polylogarithmic generator functions g p with parameters a ( 0 , 1 ) , m R is defined by

(5.5) g p ( r ) = Li m ( p 1 ) 2 ( a e r ) π p 2 Li m + 1 2 ( a )

for r 0 , where z Li m ( z ) = k = 1 z k k m is the polylogarithmic function. Some interesting special values are

Li 1 ( x ) = ln ( 1 x ) , Li 0 ( x ) = x 1 x , Li 1 ( x ) = x ( 1 x ) 2 .

In the case of an integer parameter m 1 , the generators g p with odd indices can be represented by a rationale function of x or by a logarithmic one. The proof that this family is a consistent family of density generators can be found in Section 7.2, Lemma 7.6.

5.11 Bessel I generator

By using modified Bessel functions K m of the second kind (cf. [1], pp. 374), we define generator functions for dimension p with parameter m > 1 2 ([6], p. 72, Example 2.6.4)

(5.6) g p ( r ) = r m 2 ( p 1 ) 4 2 m + ( p 1 ) 2 π p 2 Γ ( m + 1 2 ) K m ( p 1 ) 2 ( r )

for r 0 . Notice that K 1 2 ( z ) = π 2 e z z 1 2 and K 3 2 ( z ) = π 2 e z ( 1 + z ) z 3 2 such that explicit formulas for K ν + 1 2 ( ν N ) are available. The consistency proof for { g p } p 1 is provided in Lemma 7.7.

5.12 Bessel II generator

We introduce generator functions for dimensions 1–3:

(5.7) g 1 ( r ) = e r a 2 ( r + a ) 1 2 K 0 ( a 2 ) , g 2 ( r ) = e r 2 2 π K 0 ( a 2 ) K 0 a + r 2 + K 1 a + r 2 , g 3 ( r ) = e r a 2 ( 1 + 2 a + 2 r ) 2 π ( r + a ) 3 2 K 0 ( a 2 ) ( r 0 ) .

The generator functions for higher dimensions p can be evaluated straightforwardly. The consistency proof for { g p } p 1 is located in Lemma 7.8. For the Bessel II generator, we are able to provide function f 0 :

f 0 ( t ) = e a ( t 1 ) 2 H t 2 1 ( t ( t 2 ) ) 1 2 K 0 ( a 2 ) .

5.13 Linear-exponential generator

Define

g p ( r ) = ( r + a p + 1 ) e r 2 ( 2 π ) p 2 ( a + 1 )

for p 1 , r 0 , a > 2 . Utilizing a CAS, it is shown that (3.1)–(3.3) hold true. Then { g p } p = 1 p 0 is a finite consistent family of density generators if a + 1 > p 0 . In principle, it is possible to generalize the linear factor to a polynomial factor but then the choice of the parameters has to be considered carefully to obtain a family of density generators.

5.14 Kotz-type generator

The article by Nadarajah [15] gives a good review of properties of Kotz-type elliptical distributions. The general formula for the generator function of dimension p with parameters N > ( 2 p ) 2 , a , s > 0 is given by

(5.8) g p ( r ) = r N 1 exp ( a r s ) .

Unfortunately, starting from a Kotz-type g 1 according to (5.8), only generators of odd index can be represented by an explicit formula. Furthermore, starting from a Kotz-type g 2 according to (5.8), there are no explicit formulas for the marginal densities of dimension 1 and odd dimensions. Exceptions exist only in some very special cases, e.g., N = 1 , s = 1 (normal distribution). A series-integral representation of the one-dimensional density is provided in the study by Nadarajah [15]. Therefore, the formula for Kotz generator g p cannot be used as a basis for a spherical family represented by explicit formulas.

Logistic and exponential power generator functions g 1 lead to very sophisticated formulas for g p or the corresponding g p cannot represented by an explicit formula. Elliptical distributions with logistic generators are examined in the study by Wang and Yin [18]. We will not go into further detail here.

6 Models for generator functions on the finite interval [ 0 , 1 ]

In a remark below the algorithms in Section 3, it was stated that the algorithm for the case p 0 = gives only strictly positive generator functions on [ 0 , + ) . Therefore, only finite families { g p } p : 1 p p 0 are suitable for modelling spherical and elliptical densities concentrated on finite intervals. We consider only two of them.

6.1 Power distribution on [ 0 , 1 ]

The density generator is given by

(6.1) g p ( r ) = ( 1 r ) b ( p 1 ) 2 Γ ( b + 3 2 ) π p 2 Γ b + 3 p 2 for r [ 0 , 1 ] , p : 1 p 2 b + 1 ,

where b > 0 is the parameter. The proof that this family is consistent for p 0 = 2 b + 3 1 can be found in Section 7, Lemma 7.9. The corresponding one-dimensional density is given by

g 1 ( z 2 ) = ( 1 z 2 ) b Γ ( b + 3 2 ) π Γ ( b + 1 ) for z [ 1 , 1 ] .

The density of R p can immediately be derived:

h p ( r ) = 2 r p 1 ( 1 r 2 ) b ( p 1 ) 2 Γ ( b + 3 2 ) Γ ( p 2 ) Γ b + 3 p 2 for r [ 0 , 1 ] .

6.2 Uniform distribution

The uniform distribution ([6], p. 71, Example 2.6.3) is a special case of the power distribution in the b = ( p 1 ) 2 . We have

g p ( r ) = π p 2 Γ 1 + p 2 , h p ( r ) = p r p 1 for 0 r 1 .

7 Proofs

7.1 Proofs of the results in Sections 1–3

Proof of Theorem 1.1

Let X SC p ( g p ) and Q R p , p be any orthogonal matrix. Then Y = Q X has the density

f Y ( y ) = g p ( y T Q Q T y ) = g p ( y T y ) ( y R p ) .

Since this density does not depend on Q , Theorem 1.1 follows by applying Theorems 2.5.3 and 2.5.5 in the paper by Fang and Zhang [6].□

Proof of Theorem 1.3

By Theorem 2.6.2 of [6], μ = μ and Σ = c Σ with a constant c . Then

f Y ( y ) = c p 2 Σ 1 2 g p ( c 1 ( y μ ) T Σ 1 ( y μ ) ) = Σ 1 2 g p ( ( y μ ) T Σ 1 ( y μ ) )

for almost every y R p , which implies g p ( z ) = c p 2 g p ( c z ) for almost every z R p .□

Next, we prove the complete monotonicity of functions g p and a further auxiliary statement.

Lemma 7.1

Let g 1 , g 2 , g 3 : [ 0 , ) [ 0 , ) be functions fulfilling (3.1) for p = 1 , (3.2) and lim r g 1 ( r ) = 0 . Then

(7.1) g 1 ( r ) = 2 0 g 2 ( r + y 2 ) d y ( r 0 ) .

Proof

By (3.1) for p = 1 and (3.2), we obtain

2 0 g 2 ( u + y 2 ) d y = 4 0 0 g 3 ( u + y 2 + t 2 ) d t d y = 4 0 π 2 0 r g 3 ( u + r 2 ) d r d α (polar coordinates) = π 0 g 3 ( u + r ) d r = π 1 π g 1 ( u + r ) r = 0 = g 1 ( u ) g 1 ( ) = g 1 ( u ) .

Lemma 7.2

Suppose that function g 1 : [ 0 , ) [ 0 , ) is completely monotonic with g 1 ( ) = 0 . Let (3.1) and (3.2)be fulfilled. Then all functions g p are non-negative and completely monotonic and

(7.2) g 2 k + p ( r ) = g p ( k ) ( r ) ( π ) k

for r , k 0 , p 1 .

Proof

Assuming (3.1), one can easily show (7.2) by induction. Observe that

g 3 ( r ) = 1 π g 1 ( r ) 0

for r 0 . By (7.2), g 2 k + 1 is non-negative for k 0 , and we obtain

g 2 k + 1 ( m ) ( r ) ( 1 ) m = g 1 ( k + m ) ( r ) π k ( 1 ) k + m 0

for r , k , m 0 , which is the assertion of the lemma for odd p . Equation (7.2) for p = 2 shows that g 2 is infinitely differentiable. Condition (3.2) implies that

g 2 ( r ) = 2 0 g 3 ( r + y 2 ) d y = 2 π 0 g 1 ( r + y 2 ) d y 0 .

Hence, by taking derivatives and applying the Leibniz rule, we derive

g 2 ( m ) ( r ) ( 1 ) m = 2 π ( 1 ) m + 1 0 g 1 ( m + 1 ) ( r + y 2 ) d y 0

for r , m 0 , since g ˜ ( t ) ( 1 ) m + 1 g 1 ( m + 1 ) ( t ) ( t , m 0 ) is non-negative and monotonously non-increasing ( g ˜ ( t ) 0 ), ( 1 ) m + 1 g 1 ( m + 1 ) ( r + t 2 ) g ˜ ( t ) for r 0 , t 1 and 1 g ˜ ( t ) d t = ( 1 ) m + 1 ( g 1 ( m ) ( ) g 1 ( m ) ( 1 ) ) < . Therefore, g 2 is completely monotonic. Further from (7.2), we obtain

g 2 k + 2 ( m ) ( r ) ( 1 ) m = g 2 ( k + m ) ( r ) π k ( 1 ) k + m 0

for r , k , m 0 . This proves the lemma.□

Proof of Theorem 3.2

(a) part : Assume that the family { g p } p 1 of non-negative functions fulfills (2.2), and g p ( 0 ) = g p ( 0 + ) < + for p 1 . Hence, (3.2) holds true. Changing the coordinate system to the polar one, we obtain

(7.3) g p ( u ) = 4 0 0 g p + 2 ( u + y 2 + t 2 ) d t d y = 4 0 π 2 0 g p + 2 ( u + r 2 ) r d r d α = π 0 g p + 2 ( u + r ) d r

for p 1 , u 0 . We denote the antiderivative of g p by G p where G p ( 0 ) = 0 . Note that by (7.3),

lim u G p + 2 ( u ) = 0 g p + 2 ( r ) d r = g p ( 0 ) π 1 < +

for p 1 . Further by (7.3), we derive

g p ( u + h ) g p ( u ) h = π h 0 ( g p + 2 ( u + h + r ) g p + 2 ( u + r ) ) d r = π h ( G p + 2 ( ) G p + 2 ( u + h ) ( G p + 2 ( ) G p + 2 ( u ) ) ) = π h ( G p + 2 ( u + h ) + G p + 2 ( u ) )

for p 1 , u 0 . Hence, taking the limit h 0 leads to identity (3.1). By induction, we obtain

g 1 ( k ) ( r ) ( π ) k = g 2 k + 1 ( r ) 0 ( k 0 )

from (3.1) and the proof of part a) is complete.

(b) part : Assume that identities (3.1) and (3.2) are fulfilled and g 1 is completely monotonic. Claim: (2.2) holds true.

In view of Lemma 7.1, Equation (7.1) holds true. Hence,

g j ( r ) = 2 0 g j + 1 ( r + y 2 ) d y

holds for j = 1 , 2 . Observe that g 2 and g 3 are completely monotonic in view of Lemma 7.2. Taking derivatives in (7.1) and applying the Leibniz rule and (7.2) (see Lemma 7.2), we obtain

g 2 k + j ( r ) = g j ( k ) ( r ) ( π ) k = 2 0 g j + 1 ( k ) ( r + t 2 ) d t ( π ) k = 2 0 g 2 k + j + 1 ( r + t 2 ) d t

for since g ˜ ( t ) ( 1 ) k g j + 1 ( k ) ( t ) ( t 0 , k 1 , j = 1 , 2 ) is non-negative and monotonously non-increasing ( g ˜ ( t ) 0 ), ( 1 ) k g j + 1 ( k ) ( r + t 2 ) g ˜ ( t ) for r 0 , t 1 and 1 g ˜ ( t ) d t = ( 1 ) k ( g j + 1 ( k 1 ) ( ) g j + 1 ( k 1 ) ( 1 ) ) < . Hence, the claim is proved. Since all functions g p are completely monotonic on [ 0 , ) by Lemma 7.2, and hence continuous at 0, condition g p ( 0 + ) < + is fulfilled for p 1 , and functions g p are non-negative. The proof of the theorem is now complete.□

Proof of Proposition 3.3

Observe that for the Caputo-derivative with respect to u ,

( g p ( u ) ) ( 1 2 ) = 1 Γ ( 1 2 ) u 1 u y g p ( y ) d y ( u 0 ) .

Equations (3.1) and (2.2) imply

( g p ( u ) ) ( 1 2 ) = 1 π u 1 y + u g p ( y ) d y = π u 1 y + u g p + 2 ( y ) d y = π g p + 1 ( u )

for u 0 .□

The following Lemma 7.3 provides sufficient conditions for (1.1).

Lemma 7.3

Let { g p } p I be a family of functions g p : [ 0 , ) [ 0 , ) . Assume that (2.2) and (3.3) are satisfied. Then (1.1) is satisfied for p I .

Proof

In view of equation (2.2), we obtain

0 r p 2 1 g p ( r ) d r = 0 r p 2 1 r ( t r ) 1 2 g p + 1 ( t ) d t d r = 0 0 t r p 2 1 ( t r ) 1 2 d r g p + 1 ( t ) d t = π Γ ( p 2 ) Γ ( ( p + 1 ) 2 ) 0 r ( p 1 ) 2 g p + 1 ( r ) d r

for p + 1 I . By induction and by (3.3), we obtain

0 r p 2 1 g p ( r ) d r = π p 2 Γ p 2 = s p 1 .

The proof of the lemma is now complete.□

Now we are in a position to prove Theorem 3.4.

Proof of Theorem 3.4

(i) Case p 0 = : Theorem 3.4 is a consequence of Theorem 3.2 and Lemma 7.3.

(ii) Case p 0 < :

Claim: Equation (2.2) holds true for p + 1 I .

Similarly to the proof of Theorem 3.2, part , we obtain

g 2 k + j ( r ) = g j ( k ) ( r ) ( π ) k 0 for r 0 , j = 1 , 2 , 3 , k 1 , 2 k + j I , and

g 2 k + j ( r ) = 2 0 g j + 1 ( k ) ( r + t 2 ) d t ( π ) k = 2 0 g 2 k + j + 1 ( r + t 2 ) d t

for r 0 , j = 1 , 2 , k 1 , 2 k + j + 1 I . Hence, the claim is proved.

An application of Lemma 7.3 yields the validity of (1.1) for p I . Therefore, the proof is complete.□

7.2 Proofs of the results in Section 5

In this section, we show consistency of several families of generators:

Lemma 7.4

The family { g p } p 1 defined in (5.1) is a consistent family of non-negative density generators.

Proof

Obviously, g p ( r ) 0 and g 1 is completely monotonic. It can be checked by using a CAS that conditions (3.1)–(3.3) hold. Consistency of { g p } follows in view of Theorem 3.4.□

Lemma 7.5

The family { g p } p 1 resulting from (5.2) by the algorithm is a consistent family of non-negative density generators.

Proof

By [14], p. 390, the function u ln ( a + u ) ( u + a 1 ) is completely monotonic for a 1 , u 0 . Further u ( u + a 1 ) ( u + b ) is completely monotonic for b a 1 , u 0 . The product of these two functions is again completely monotonic (cf. Theorem 1 of [14]). By using a CAS, one can show that (3.3) is satisfied. Apply Theorem 3.4 to obtain the lemma.□

Lemma 7.6

The family { g p } p 1 defined in (5.5)  is consistent.

Proof

By using the definition of the Li function, we obtain

(7.4) g p ( r ) = Li m ( p 1 ) 2 ( a e r ) π p 2 Li m + 1 2 ( a ) = 1 π p 2 Li m + 1 2 ( a ) k = 1 k m + p 2 1 2 a k e k r

for r 0 . Note that Li m ( p 1 ) 2 ( 0 ) = 0 such that lim r g 1 ( r ) = 0 . Obviously, r e k r is completely monotonic. Since the coefficients in the series in (7.4) are positive, g p is a completely monotonic function in view of Theorem 3 of [14]. Notice that e k r 2 d r = π k holds true. We have

g 1 ( r 2 ) d r = 1 π Li m + 1 2 ( a ) k = 1 k m a k e k r 2 d r = 1 Li m + 1 2 ( a ) k = 1 k m 1 2 a k = 1 .

Further

g p + 2 ( r ) = 1 π g p ( r ) = 1 π ( p + 2 ) 2 Li m + 1 2 ( a ) Li m ( p + 1 ) 2 ( a e r )

holds for r 0 . It remains to show that (3.2) is valid. By (7.4),

2 0 g 3 ( r + y 2 ) d y = 2 π 3 2 Li m + 1 2 ( a ) k = 1 k m + 1 a k 0 e k r k y 2 d y = 1 π Li m + 1 2 ( a ) k = 1 k m + 1 2 a k e k r = g 2 ( r ) .

An application of Theorem 3.4 leads to the lemma.□

Lemma 7.7

The family { g p } p 1 defined by (5.6) is consistent and the functions g p are density generators.

Proof

Ismail showed in [7] on p. 354 that the function r r ν 2 K ν ( r ) is completely monotonic for ν > 1 2 . Hence, g 1 is completely monotonic. Utilizing a CAS, it is shown that (3.1)–(3.3) hold true. Therefore, the lemma follows by Theorem 3.4.□

Lemma 7.8

The two families { g p } p 1 resulting from (5.3) and (5.7) by the algorithm are consistent and the functions g p are density generators.

Proof

In view of the study by Miller and Samko [14], the functions r ( a + r ) 1 and r ( a + r ) 1 2 are completely monotonic. Since r e r is a completely monotonic function and products of completely monotonic functions have this property (cf. Theorem 1 of [14]), g 1 is completely monotonic. The validity of (3.1)–(3.3) is shown by using CAS. Theorem 3.4 is obtained to obtain the lemma.□

Lemma 7.9

The family { g p } 1 p p 0 defined in (6.1) is consistent for p 0 = 2 b + 3 1 .

Proof

Note that

1 π g p ( r ) = b p 1 2 ( 1 r ) b ( p + 1 ) 2 Γ b + 3 2 π 1 + p 2 b p 1 2 Γ b + 1 p 2 = g p + 2 ( r )

for r 0 . Further, we derive

2 0 1 u g p + 1 ( u + t 2 ) d t = 2 0 1 u ( 1 u t 2 ) b p 2 d t Γ b + 3 2 π ( p + 1 ) 2 Γ b + 2 p 2 = ( 1 u ) b ( p 1 ) 2 Γ b + 2 p 2 Γ b + 3 2 Γ b + 3 p 2 π p 2 Γ b + 2 p 2 = g p ( u ) .

Moreover, g p satisfies identity (1.1). This completes the proof in view of Theorem 3.4.□

Acknowledgement

The author would like to thank the two anonymous reviewers for careful reading and for their valuable hints leading to improvements of the article.

  1. Conflict of interest: The author states no conflict of interest.

Appendix A Definition of the fractional derivative

DEFINITION: (According to Oliveira and de Oliveira [16]) Let a [ , ) , ν > 0 , ν N , and n = [ ν ] + 1 , where [ α ] is the integer part of α . The fractional derivative of order ν in the sense of Caputo of function φ : R R is defined by

D a ν C φ ( x ) = 1 Γ ( n ν ) a x φ ( n ) ( t ) ( x t ) ν n + 1 d t for x > a .

B Graphics of generator functions

This section provides figures of the generator functions on the left and the one-dimensional marginal density on the right.

(1) Normal generator (blue), mixed normal generator q = 1 2 , a = 2 (orange), power generator (green m = 2 , red m = 6 )

(2) Logarithmic generator I, blue: a = 3 , b = 1 , orange: a = 6 , b = 5 , green: a = 6 , b = 1 , red: normal generator r a 2 π p 2 exp a r 2 with a = 2

(3) Fractional-exponential generator blue: a = 1 , orange: a = 3 , green: a = 10 , red: normal generator

(4) polylogarithmic generator blue: a = 1 , orange: a = 3 , green: a = 10 , red: normal generator

References

[1] Abramowitz, M., & Stegun, I. (Eds.) (1970). Handbook of mathematical functions with formulas, graphs, and mathematical tables, U.S. Government Printing Office, Washington, D.C. National Bureau of Standards Applied Mathematics Series. Search in Google Scholar

[2] Anderson, T. (1993). Nonnormal multivariate distributions: Inference based on elliptically contoured distributions. In: C. Rao (Ed.), Multivariate Analysis: Future Directions (Vol. 5, pp. 1–24). Amsterdam: North-Holland, North-Holland Ser. Stat. Probab. 10.21236/ADA254999Search in Google Scholar

[3] Cambanis, S., Huang, S., & Simons, G. (1981). On the theory of elliptically contoured distributions. Journal of Multivariate Analysis, 11, 368–385. 10.1016/0047-259X(81)90082-8Search in Google Scholar

[4] Dubey, S. D. (1970). Compound gamma, beta and f distributions. Metrika, 16, 27–31. 10.1007/BF02613934Search in Google Scholar

[5] Fang, K.-T., Kotz, S., & Ng, K. (1987). Symmetric multivariate and related distributions. London: Chapman & Hall. Search in Google Scholar

[6] Fang, K.-T., & Zhang, Y. (1990). Generalized multivariate analysis. Berlin, Heidelberg: Springer-Verlag. Search in Google Scholar

[7] Ismail, M. (1990). Complete monotonicity of modified bessel functions. Proceedings of the American Mathematical Society, 108, 353–361. 10.1090/S0002-9939-1990-0993753-9Search in Google Scholar

[8] Kano, Y. (1994). Consistency property of elliptical probability density functions. Journal of Multivariate Analysis, 51, 139–147. 10.1006/jmva.1994.1054Search in Google Scholar

[9] Kelker, D. (1970). Distribution theory of spherical distributions and a location-scale parameter generalization. Sankhya: Series A, 32, 419–430. Search in Google Scholar

[10] Liebscher, E. (2005). A semiparametric density estimator based on elliptical distributions. Journal of Multivariate Analysis, 92, 205–225. 10.1016/j.jmva.2003.09.007Search in Google Scholar

[11] Lorch, L., & Newman, D. (1983). On the composition of completely monotonic functions and completely monotonic sequences and related questions. Journal of the London Mathematical Society, s2–28, 31–45. 10.1112/jlms/s2-28.1.31Search in Google Scholar

[12] Maruyama, Y., & Seo, T. (2003). Estimation of moment parameter in elliptical distributions. Journal of the Japan Statistical Society, 33, 215–229. 10.14490/jjss.33.215Search in Google Scholar

[13] McNeil, A. J., Frey, R., & Embrechts, P. (2005). Quantitative risk management. Princeton, New Jersey: Princeton University Press. Search in Google Scholar

[14] Miller, K., & Samko, S. (2001). Completely monotonic functions. Integral Transforms and Special Functions, 12, 389–402. 10.1080/10652460108819360Search in Google Scholar

[15] Nadarajah, S. (2003). The kotz-type distribution with applications. Statistics, 37(4), 341–358. 10.1080/0233188031000078060Search in Google Scholar

[16] Oliveira, D. S., & de Oliveira, E. C. (2018). On a caputo-type fractional derivative. Advances in Pure and Applied Mathematics, 10, 81–91. 10.1515/apam-2017-0068Search in Google Scholar

[17] Srivastava, M. S., & Bilodeau, M. (1989). Stein estimation under elliptical distributions. Journal of Multivariate Analysis, 28, 247–259. 10.1016/0047-259X(89)90108-5Search in Google Scholar

[18] Wang, Y., & Yin, C. (2021). A new class of multivariate elliptically contoured distributions with inconsistency property. Methodology and Computing in Applied Probability, 23, 1377–1407. 10.1007/s11009-020-09817-7Search in Google Scholar

Received: 2023-09-28
Revised: 2023-12-14
Accepted: 2023-12-14
Published Online: 2023-12-31

© 2023 the author(s), published by De Gruyter

This work is licensed under the Creative Commons Attribution 4.0 International License.

Downloaded on 14.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/demo-2023-0111/html
Scroll to top button