Skip to main content
Entropy logoLink to Entropy
. 2022 Jul 28;24(8):1041. doi: 10.3390/e24081041

Stochastic Properties of Fractional Generalized Cumulative Residual Entropy and Its Extensions

Ghadah Alomani 1, Mohamed Kayid 2,*
Editor: Maria Longobardi
PMCID: PMC9407344  PMID: 36010705

Abstract

The fractional generalized cumulative residual entropy (FGCRE) has been introduced recently as a novel uncertainty measure which can be compared with the fractional Shannon entropy. Various properties of the FGCRE have been studied in the literature. In this paper, further results for this measure are obtained. The results include new representations of the FGCRE and a derivation of some bounds for it. We conduct a number of stochastic comparisons using this measure and detect the connections it has with some well-known stochastic orders and other reliability measures. We also show that the FGCRE is the Bayesian risk of a mean residual lifetime (MRL) under a suitable prior distribution function. A normalized version of the FGCRE is considered and its properties and connections with the Lorenz curve ordering are studied. The dynamic version of the measure is considered in the context of the residual lifetime and appropriate aging paths.

Keywords: FGCRE, generalized cumulative residual entropy, mean residual lifetime, stochastic orders

1. Introduction

The classical Shannon entropy (see Shannon [1]) associated with a random variable (RV) X has a crucial role in many branches of science to measure the uncertainty contained in X. Throughout the paper, X denotes a non-negative RV with an absolutely continuous cumulative distribution function (CDF) with corresponding probability density function (PDF) f. The Shannon differential entropy is

H(X)=0f(x)logf(x)dx. (1)

Possible alternative measures of information have been introduced in the literature.

The cumulative residual entropy (CRE) initiated by Rao et al. [2] as a counterpart to (1), obtained by substituting the survival function (SF) S1F in place of the PDF f, as

E(X)=0+S(x)logS(x)dx=0+S(x)Ω(x)dx, (2)

where

Ω(x)=logS(x)=0xλ(u)du,x>0, (3)

is the cumulative the hazard rate (HR) function and λ(t)=f(t)S(t),t>0, is the HR function. Dynamic versions of the CRE were considered in Asadi and Zohrevand [3] and also in Navarro et al. [4] where the CRE of the residual lifetime Xt=(Xt|X>t) was measured as

E(t)=E(X;t)=tS(x)S(t)logS(x)S(t)dx,t>0.

For related results, one can see Baratpour [5], Baratpour and Habibi Rad [6] and also Toomaj et al. [7] and the references therein. In a recent work by Di Crescenzo et al. [8], the CRE measure was extended to FGCRE as

Eα(X)=c(α)0S(x)[logS(x)]αdx, (4)

where c(α)=1Γ(α+1),α0. The notation c(α) is used across the paper. Note that c(n)=1n!. The properties of fractional cumulative entropy, such as its alteration under linear transformations, its bounds, its connection to stochastic orders along with its empirical estimation, and various relations to other functions have been argued and discussed by Xiong et al. [9]. We note that, as pointed out by [8], if α is a positive integer, say, α=nN, then En(X) is identical to the generalized cumulative residual entropy (GCRE) introduced by Psarrakos and Navarro [10]. It is noticeable that En(X) is considered a dispersion measure. The measure is also connected to the relevance transformation and interepoch intervals of a nonhomogeneous Poisson process (see, e.g., Toomaj and Di Crescenzo [11]). This paper aims to continue this line of research. In this context, we present new findings on the FGRCE and its dynamic version. The FGCRE is in particular a suitable quantity to be applied in the proportional HR model.

The subsequent materials of this article are organized in the following order. In Section 2, we first give an overview of the concept of generalized cumulative residual entropy and present a similar representation for fractional generalized residual cumulative entropy. We then give some expressions for the FGCRE, one of which is related to the MRL function. We also consider the connection of the FGCRE with the excess wealth order and the Bayesian risk of the FGCRE. A normalized version of the FGCRE is given and its connection with the Lorenz curve order is studied. Section 3 examines some bounds and stochastic ordering properties of FGCRE. In Section 4, properties of the dynamic FGCRE are discussed.

The reader can be referred to [12] for the definitions of stochastic orders st,hr,lr,ew and Lorenz and for the definitions of (increasing) decreasing MRL (IMRL(DMRL)), (decreasing) increasing failure rate (DFR (IFR)) and new better (worse) than used in expectation (NBUE (NWUE)) classes.

2. Basic Properties

As mentioned earlier, the FGCRE in (4) reduces to the GCRE when α=nN. In this case,

En(X)=c(n)0S(x)[Ω(x)]ndx=c(n)0S(x)[logS(x)]ndx (5)

for all n=0,1,. As pointed out by Psarrakos and Navarro [10], the GCRE fulfills the following property:

En(X)=μn+1μn,n0, (6)

where μn=E[Xn+1] and Xn denotes the epoch times of a Poisson process which is nonhomogeneous having intensity function λ(x). Note that X1 and X are equally distributed. Signifying by Sn+1(x) the SF of Xn+1,n{0,1,2,}, one has (see Baxter [13])

Sn+1(x)=S(x)k=0nΩk(x)k!,x0, (7)

and the PDF of Xn+1 is

fn+1(x)=c(n)f(x)Ωn(x),x0. (8)

In the following, we show that the same results can be obtained for the FGCRE. It is worth noting that our results are extensions of the results obtained using the GCRE. To this end, we define the RV Xα+1 with the PDF as

fα+1(x)=c(α)[Ω(x)]αf(x),x0, (9)

for all α>0 where Ω(x) is defined in (3). Denoting by Sα+1(x) the SF of Xα+1, it can be represented as Sα+1(x)=Bα+1(S(x)),x0, where

Bα(t)=c(α)0t(logu)αdu,t(0,1),

is increasing in t for all α0. If α is an integer, say, α{0,1,2,}, then (9) reduces to (8). Notice that from (4), the FGCRE can be rewritten as

Eα(X)=E1λ(Xα+1),x>0, (10)

for all α0. From (9), the ratio

fα2(x)fα1(x)=c(α2)c(α1)Ω(x)α2α1,x>0,

is increasing in t and, therefore, Xα1lrXα2 for any 0<α1α2. In particular, this implies that Xα1stXα2. That is, Sα1(x)Sα2(x) for all 0<α1α2. Hence, if X is IFR (DFR), then, from (10) and Equation (1.A.7) in [12], we have

Eα1(X)()Eα2(X), (11)

for all α1α2. In Table 1, we give FGCREs for a number of distributions.

Table 1.

FGCREs for a number of distributions.

Distribution S(x) Eα(X)
Uniform(0,b) 1xb,0xb b2α+1,b>0.
Weibull(1,k) exk,x>0 c(α+1)kc(α+1k),k>0.
Burr Type II(c,k) (1+xc)k,x>0 kαci=01c1i(1)i(k+i1c)α+1,c,k>0.
Beta(1,b) (1x)b,0x1 bα(b1)α+1,b>1.

Now, we obtain an analogue representation for the FGCRE which is a generalization of relation (6) with FGCRE in place of GCRE.

Proposition 1.

Let X have FGCRE Eα(X). Then, for all α0,

Eα(X)=E[Xα+1]E[Xα]. (12)

Proof. 

Recalling (4) and integrating by parts, we obtain

Eα(X)=c(α)0x[Ω(x)]αf(x)dxα0x[Ω(x)]α1f(x)dx=0xfα+1(x)dxαc(α+1)c(α)0xfα(x)dx=E[Xα+1]E[Xα],

where the last equality is obtained by recalling (9) and using c(α)=αc(α+1). □

Note that Eα(X) is the areas surrounded between Sα+1 and Sα for all α0. In particular, S0=E(X) is the area under S1=S. In Figure 1, we depict these areas for the exponential distribution and various values of α.

Figure 1.

Figure 1

Sα(x) for an exponential distribution for α=1,1.5,2,2.5,3,3.5. The area under S1(x)=S(x) is E¯(X) and the areas among them give the amounts of the FGCRE Eα(X) for α=1,1.5,2,2.5,3,3.5.

Theorem 1.

(i) If, for some p>1/α, E(Xp)<,then Eα(X)<for all 0<α1.

(ii) If, for some p>α, E(Xp)<,then Eα(X)<for all α1.

Proof. 

(i) It is not difficult to see whether for each 0α1, and 0β1, one can obtain

x(logx)ααe11βαxβ,0x1, (13)

By taking β=α for 0α1, we obtain

x(logx)ααe11ααxα,0x1.

Thus, one concludes

Eα(X)αe11αα0Sα(x)dx=αe11αα01Sα(x)dx+1Sα(x)dxαe11αα1+1Sα(x)dxαe11αα1+1E(Xp)xpαdx=αe11αα1+[E(Xp)]α11xαpdx,

where the third inequality is obtained by virtue of the Markov inequality. The last expression is finite if p>1α and this completes the proof. In the case when α1, the results apply to β=1/α.

Note that Eα(X)=Eα(Y),α0, does not guarantee equality in the distributions of X and Y, but the converse holds. If Y=i(X), where i(·) is strictly increasing and differentiable, then

Eα(Y)=c(α)0i(u)S(u)[logS(u)]αdu, (14)

for all α0. Below, the connection between the FGCRE and the cumulative HR function of X given by (3) is realized.

Theorem 2.

Let X fulfill Eα(X)<+for all α0. Then,

Eα(X)=E[Ωα(2)(X)], (15)

where

Ωα(2)(x)=c(α)0xΩα(t)dt,x0. (16)

Proof. 

From (4) and also by applying Fubini’s theorem,

Eα(X)=c(α)0tf(x)dxΩα(t)dt=c(α)0f(x)0xΩα(t)dtdx,

which immediately validates (15) by using (16). □

We note that Ωα(2)(x) in (16) is increasing and convex in x. This immediately generates the following property.

Theorem 3.

Let X have a finite mean μ. Then,

Eα(X)Ωα(2)(μ),

for all α0.

Another useful application of Theorem 2 is given here.

Theorem 4.

If X and Y are non-negative RVs in the way XicxY, it holds that

Ωα(2)(X)icxΩα(2)(Y),α0,

where the function Ωα(2)(·) is given in (16). In particular, XicxY implies

Eα(X)Eα(Y).

Proof. 

Since Ωα(2)(·) is a convex function and also since it is an increasing function for all α0, thus (see Theorem 4.A.8 in [12]), Ωα(2)(X)icxΩα(2)(Y),α0. Now, using relation 4.A.2 in [12], we derive Eα(X)Eα(Y). □

Clearly, Ωα(2)(·) is increasing and also convex and Ωα(2)(0)=0. Hence, for the RVs X and Y satisfying XhrY, we obtain that

Eα(X)E(X)Eα(Y)E(Y), (17)

for all α0. This relation is immediately obtained from Theorem 2 and Shaked and Shantikumar [12] (see page 24). It is worth pointing out that Equation (17) leads us to define the normalized FGCRE by

NEα(X)=Eα(X)E(X). (18)

Under the condition XhrY, Equation (17) can be rewritten as NEα(X)NEα(Y) for α0. Moreover, if X is a non-negative RV having IFR (DFR) property, from relation (11), one can conclude that

E0(X)()Eα(X),forallα0.

From this, we derive that NEα(X)()1,α0. For α=1, the normalized cumulative residual entropy NE1(X) is generated (see Rao [2]). This is an analogue for the coefficient of variation of an RV. In Table 2, we give the normalized FGCREs for some distributions.

Table 2.

FGCREs for several distributions.

Distribution S(x) NEα(X)
Uniform 1xb,0xb 12α,b>0.
Weibull exk,x>0 c(α)c(1+1k)kc(α+1k),k>0.
Burr Type II (1+xc)k,x>0 kα1cB(k1c,1+1c)i=01c1i(1)i(k+i1c)α+1,c,k>0. *
Beta (1x)b,0x1 bα(b+1)(b1)α+1,b>1.

* B(·, ·) denotes the complete beta function.

To continue our results, consider the following observation.

Theorem 5.

Let Eα(X)<+ for all α0. Then

NEα(X)=01[pLX(p)]gα(p)dp, (19)

where

gα(p)=[log(1p)]α2Γ(α)(1p)[log(1p)(α1)],0p1.

Proof. 

Recalling Proposition 1 and the change of z=F(x), we have

NEα(X)=1μ01[F1(z)μ]Gα(z)dz, (20)

where

Gα(z)=α[log(1z)]α[log(1z)]α1Γ(α)+1,0z1,

for all α>0. In (20), let u=Gα(z),α0, and dv=[F1(z)μ]dz. Then du=gα(z)dz and v=0p[F1(z)μ]dz. Integrating by parts gives

NEα(X)=01gα(p)0p1F1(z)μdp,

and this gives the proof. □

When α=1, the De Vergottini index of inequality of an income distribution X is reached, given by NE1(X)=E1(X)/E(X) (see Rao et al. [2] for more details). The index (19) belongs to the class of linear measures of income inequality defined by Mehran [14]. It can be obtained by weighting the Lorenz differences pLX(p) together with the income distribution.

Theorem 6.

Let X1 and X2 be non-negative RVs with survival functions S1(x) and S2(x), respectively. If X1LorenzX2, then NEα(X1)NEα(X2) for all 0α1.

Proof. 

Assumption X1LorenzX2 implies that LX(p)LY(p),p[0,1], due to Theorem 3.A.10 in [12]. From relation (19), we obtain

[pLX(p)]gα(p)[pLY(p)]gα(p),p[0,1],

where the inequality is obtained by noting that gα(p),0p1, is a non-negative function for all 0α1. The result is obtained by reversing. □

The Bayes Risk of MRL

The PDF of Xt is given by ft(x)=f(x)/S(t) for x>t. Denote by m(t) the MRL function of X. In the decision theoretic framework, the MRL function is the optimal prediction of [Xt|X>t], under the conditional quadratic loss function L(d,X|t)=[(Xtd)2|X>t], as the mean of the PDF ft(x). In other words, we have

d(t)=argmindEX>t[L(d,X|t)]=m(t),t>0,

for all α>0. The function m(t) is a local risk measure, given the value the threshold t takes. Its global risk of the MRL function of X is the Bayes risk

E(m)=Eπ[m(X)], (21)

where Eπ denotes the average based on the prior PDF for the threshold t (see Ardakani et al. [15] and Asadi et al. [16] for more details). The following theorem provides expressions for E(m) under different priors.

Theorem 7.

Let X have the MRL function m, and let π(t)=fα(t),t0. Then, the Bayes risk of m(t) is given by the FGCRE functional of the baseline CDF, i.e.,

E(m)=Eα(X). (22)

Proof. 

By substituting π(t)=fα(t)=c(α1)[Ω(t)]α1f(t),t0, for all α>0, we have

E(m)=0m(t)π(t)dt=0m(t)fα(t)dt=0tS(x)dxS(t)fα(t)dt=0S(x)0xfα(t)S(t)dtdx=c(α)0S(x)[logS(x)]αdx.

The second equality follows by observing that

0xfα(t)S(t)dt=c(α1)0x[Ω(t)]α1f(t)dt=c(α)[Ω(t)]α,t0,

and the proof is completed. □

From Theorem 7, it is obvious that

Eα(X)=E[m(Xα)], (23)

for all α0. We point out that the representation in (23) is very useful since in many statistical models one may gather information about the behaviour of MRL. The following example illustrates a well-known situation in this context.

Example 1.

Let us suppose m(x)=cx+d, x0, with c>1, c0 and d>0. Oakes and Dasu [17] observed that the corresponding SF is

S(x)=dcx+d1c+1,x0,c>1,d>0.

It is a well-known property for the generalized Pareto distribution (GPD) as a fundamental aspect of this family of distributions. The exponential distribution is reached whenever c0, the Pareto distribution is resulted for c>0, and the power distribution is achieved for 1<c<0. Hence, from (23), the FGCRE of the GPD distribution is derived as

Eα(X)=cE[Xα]+d=d(c+1)α,

where the identity E[Xα]=dc[(c+1)α1], for all α0, has been applied.

The Bayes risk of m(t) under the prior π(t)=fα(t) is given by Eα(X)()μ for all α0.

3. Bounds and Stochastic Ordering

In this section, we aim to derive several results on bounds for the FGCRE and provide results based on stochastic comparisons.

3.1. Some Bounds

It is well known that the cumulative residual entropy of the sum of two non-negative independent RVs is greater than the maximum of their original entropies (see, for example, Rao et al. [2]). By a similar approach, we can verify that the same result also holds true for the FGCRE. We omit the proof.

Theorem 8.

If X1 and X2 are non-negative independent RVs, then

Eα(X1+X2)max{Eα(X1),Eα(X2)},

for all α0.

The following theorem establishes a bound for the FGCRE in terms of the cumulative residual entropy (2).

Theorem 9.

Let X have a finite mean μ and finite E(X). Then

Eα(X)c(α)[E(X)]αμα1,if0α1c(α)[E(X)]αμα1,ifα1. (24)

Proof. 

Let Xe follow the equilibrium distribution with PDF fe(x)=S(x)/μ,x>0. The FGCRE can be rewritten as

Eα(X)=μE[ψα(Ω(Xe))],

in which ψα(t)=c(α)tα,t>0, is a concave (convex) function for 0α1(α1). Therefore, Jensen’s inequality implies

Eα(X)=μE[ψα(Ω(Xe))]μc(α)ψαE[Ω(Xe)]=μc(α)1μ0+S(x)Ω(x)dxα,

and this provides the proof in the spirit of (2). If α1, the result is obtained analogously. □

In the setting of Theorem 9, the properties given below hold for the normalized FGCRE.

NEα(X)c(α)[NE(X)]α,if0α1c(α)[NE(X)]α,ifα1. (25)

Theorem 10.

If X has a finite E(X),then, for all α0,

  • (i) 

    Eα(X)CαeH(X) such that Cα=c(α)e01log(x(log(x))α)dx and H(X) given by (1).

  • (ii) 

    Eα(X)c(α)0Fα(x)S(x)dx.

Proof. 

Part (i) is easily obtained by applying the log-sum inequality (see, e.g., Rao et al. [2]). By using the identity logxx1 for 0<x1, then part (ii) can be obtained. □

We end this subsection by providing two upper bounds for the FGCRE of X. The first one is based on standard deviation of X. The second one is based on the risk-adjusted premium introduced by Wang [18] which is defined by

πq(X)=0Sq(x)dx, (26)

for all 0<q1. The risk-adjusted premium is additive when the risk is divided into layers, which makes it very attractive for pricing insurance layers. For a detailed discussion, the reader is referred to Wang [18].

Theorem 11.

Consider X with standard deviation σ(X) and FGCRE function Eα(X). Then

  • (i) 

    Eα(X)Γ(2α1)Γ(α)σ(X), for all α0.5.

  • (ii) 

    Eα(X)αe11βαπβ(X)Γ(α+1)where β=αfor 0α1and β=1/αfor α1.

Proof. 

(i) For all α0, by the Cauchy–Schwarz inequality, from (23) we obtain

0m(x)Ωα1(x)f(x)dx2=0m(x)f(x)f(x)Ωα1(x)dx20m2(x)f(x)dx0Ω2α2(x)f(x)dx.

Applying Theorem 21 of Toomaj and Di Crescenzo [11], it holds that E[m2(X)]=σ2(X). Further,

0Ω2α2(x)f(x)dx=Γ(2α1),

which is positive for all α0.5. Therefore, the proof is then completed. Part (ii) is easily obtained from relation (13) by substituting β=α for 0α1 and β=1/α for α1.

The standard deviation (SD) bound in Theorem 11 is decreasing in 1/2<α1 and increasing in α1, but it is applicable when α>1/2. However, the risk-adjustment (RA) bound is applicable for all α0. Therefore, this bound can be a useful alternative for the case of α<1/2. The following example illustrates these points.

Example 2.

Consider X with SF S(x)=exk,x>0. Then,

πβ(X)=0Sβ(x)dx=0eβxkdx=Γ(1k)kβ1k,

for all k,β>0. The variance and the FGCRE of the Weibull distribution as given in Table 1 are

σ2(X)=Γ1+2kΓ1+1k2andEα(X)=Γ(α+1k)kΓ(α+1),

respectively. Therefore, part (i) of Theorem 11 gives

Eα(X)c(α1)Γ(2α1)Γ1+2kΓ1+1k2,α>1/2.

Moreover, by taking β=α for all 0α1 and β=1/α for all α1, part (ii) of Theorem 11 gives

Eα(X)αα1keαΓ(1k)k(1α)αΓ(α+1),0α1,andEα(X)α2α+1keαΓ(1k)k(α1)αΓ(α+1),α1.

The left panel of Figure 2 indicates the plots of the SD and the RA bounds given in Theorem 11 along with the plot of Eα(X) for 0α1, and the right panel is for α1. The standard deviation bound is not valid for 0α1/2. For 1/2α1, the standard deviation bound is outperformed.

Figure 2.

Figure 2

The SD (dashed line) and the RA (dotted line) bounds as well as the exact value of FGCRE (solid line) for the Weibull model with scale parameter k=2 when 0α1 (left) and α1 (right).

3.2. Stochastic Comparisons

In this subsection, ordering distributions according to the FGCRE is considered. We provide a counterexample to show that the usual stochastic ordering does not provide ordered distributions in accordance with their FGCREs.

Example 3.

Let us consider two RVs X1 and X2 coming from the Weibull distribution with the survival functions S1(x)=ek1k1x2 and S2(x)=ek2k2x2 for all 0x1 and k1,k2>0. It is not hard to see that for k1k2, we have X1stX2. However, numerical computations illustrate that for some choices of k1 and k2 and for some choices of α, the condition Eα(X1)Eα(X2) is not fulfilled as shown in Table 3.

Table 3.

Numerical values of Eα(X1) and Eα(X2) described in Example 3.

k1 k2 α Eα(X1) Eα(X2) k1 k2 α Eα(X1) Eα(X2)
0.2 0.5 0.5 0.2329 0.2271 2 3 0.5 0.1570 0.1297
1.0 0.1843 0.1574 1.0 0.0876 0.0681
1.5 0.1503 0.1155 1.5 0.0551 0.0413
2.0 0.1221 0.0858 2.0 0.0364 0.0266
2.5 0.0980 0.0638 2.5 0.0247 0.0176

Before stating our main results, let us consider the following lemma.

Lemma 1.

If X1stX2, then X1,αstX2,α for all α0.

Proof. 

The SF of Xi,α,i=1,2, is Si,α(x)=Bα(Si(x)),x>0. Since X1stX2, we have

S1,α(x)=Bα(S1(x))Bα(S2(x))=S2,α(x),x>0,

in which the inequality follows since Bα(t) is increasing in t. Hence, the proof is completed. □

Theorem 12.

Let X1stX2. Then, for all α0:

  • (i) 

    If X1mrlX2 and either X1 or X2 is IMRL, then Eα(X1)Eα(X2).

  • (ii) 

    If X1mrlX2 and either X1 or X2 is DMRL, then Eα(X1)Eα(X2).

Proof. 

We assume that the SF of Xi,α,i=1,2, is given by Si,α(x)=Bα(Si(x)),x>0. Let X2 be IMRL. From (22), we obtain

Eα(X1)=E[m1(X1,α)]E[m2(X1,α)]E[m2(X2,α)]=Eα(X2).

The first inequality is due to X1mrlX2 and the last inequality follows since X1stX2 implies X1,αstX2,α for α0 due to Lemma 1 and this is equivalent to E[ψ(X1,α)]E[ψ(X2,α)] for all functions ψ(·) with increasing behaviour. Suppose X1 is IMRL. Then,

Eα(X1)=E[m1(X1,α)]E[m1(X2,α)]E[m2(X2,α)]=Eα(X2),

and hence the result stated in (i) is obtained. The proof for assertion (ii) is quite similar. □

Hereafter, we show that the FGCRE is connected with the excess wealth order as another concept of variability. The excess wealth transform function has some links with the MRL function as

mX(F1(p))=WX(p)p¯,p(0,1),p¯=1p. (27)

Recently, Toomaj and Di Crescenzo [11] have shown that a similar result also holds for the GCRE. The FGCRE can be calculated from the excess wealth transform employing (22).

Theorem 13.

For a non-negative RV X, we have, for all α0,

Eα(X)=c(α)01mX(F1(p))[log(1p)]α1dp. (28)

It has been established by Fernández-Ponce et al. [19] that the variance of X can be measured by excess wealth as

σ2(X)=01[mX(F1(p))]2dp.

Notice that X1ewX2 implies σ2(X1)σ2(X2) (cf. [12]). From (28), the following result is reached.

Theorem 14.

If X1ewX2, then Eα(X1)Eα(X2), for any α0.

Consequently,

XdispYXewYEα(X)Eα(Y),

for any α0.

4. Dynamic FGRCE

The study of the times for events or the age of units is of interest in many fields. The FGCRE of Xt is

Eα(t)=Eα(X;t)=c(α)tS(x)S(t)Ω(x)Ω(t)αdx,t>0, (29)

for all α0. It is clear that E0(t)=m(t). The HR of Xt is λ(x+t) for x0. Hence, if X is IFR(DFR), then Xt is also IFR(DFR) and, therefore,

Eα1(X;t)()Eα2(X;t), (30)

for all 0α1α2. On the other hand, by using the generalized binomial expansion, for all α0,

Eα(X;t)=c(α)tS(x)S(t)Ω(x)Ω(t)αdx=c(α)S(t)k=0αk(1)kΩ(t)ktS(x)Ω(x)αkdx.

In analogy with Theorem 1, the next result is procured:

Eα(X;t)=E[Xα+1Xα|X>t]=c(α)0St(x)[Ωt(x)]αdx,α0. (31)

The dynamic version of identity (22) follows from the following identity,

fα(x|t):=[Ω(x)Ω(t)]α1Γ(α)f(x)S(t),x[t,+),t0, (32)

which is the PDF of the conditional RV [Xα|X>t], α>0. This is the generalization of expression given in (33) of Toomaj and Di Crescenzo [11] when α is a positive integer. The result in Theorem 10 of Toomaj and Di Crescenzo [11] is generalized as follows:

Theorem 15.

In the setting of Theorem 7, for non-negative α and t,

Eα(X;t)=E[m(Xα)|X>t]. (33)

Theorem 16.

For any t0 and for all α0, it holds that

1αCov[Xα,Ω(Xα)|X>t]=Eα(X;t).

Proof. 

Let us denote At=[X>t]. We obtain

Cov[Xα,Ω(Xα)|At]=E[XαΩ(Xα)|At]E[Xα|At]E[Ω(Xα)|At].

From (32), one can easily obtain

E[XαΩ(Xα)|At]=txΩ(x)fα(x|t)dx=αE[Xα+1|At]+Ω(t)E[Xα|At]

and

E[Ω(Xα)|At]=tΩ(x)fα(x|t)dx=α+Ω(t),

so that

Cov[Xα,Ω(Xα)|At]=α(E[Xα+1|At]E[Xn|At]).

The result now follows from (31). □

For t=0, Theorem 16 is reduced to the next achievement:

Corollary 1.

For all α0,

1αCov(Xα,Ω(Xα))=Eα(X).

In a similar manner as in Theorem 9, the following bounds for the dynamic measure (4) are derived for t>0:

Eα(X;t)c(α)[E(X;t)]α[m(t)]α1,if0α1c(α)[E(X;t)]α[m(t)]α1,ifα1. (34)

The following theorem with the same arguments as in the proof of Theorem 10 gives the dynamic version of the FGCRE.

Theorem 17.

For X with a finite MRL function and finite E(X;t),for all α0,we have:

  • (i) 

    Eα(X;t)CαeH(X;t) in which Cα is as before. H(X;t) denotes the dynamic Shannon entropy introduced in [20].

  • (ii) 

    Eα(X;t)c(α)t1F(x)F(t)αS(x)S(t)dx.

Moreover, following the proof of Theorem 11, a couple of upper bounds for the dynamic FGCRE are acquired. The definition and properties of the variance residual lifetime (VRL) function in the context of lifetime data analysis have been studied in Gupta [21], Gupta et al. [22] and Gupta and Kirmani [23], among others.

Theorem 18.

Let X have a VRL function σ2(X;t)and finite dynamic FGCRE Eα(X;t),for all α0.Then,

  • (i) 

    Eα(X;t)Γ(2α1)Γ(α)σ(X;t), for all α0.5.

  • (ii) 

    Eα(X;t)αe11βαc(α)πβ(X;t), where β=α for 0α1 and β=1/α for α1 and πβ(X;t)=tS(x)S(t)αdx,t>0.

Now, we give an expression for the derivative of Eα(X;t).

Theorem 19.

We have

Eα(X;t)=λ(t)[Eα(X;t)Eα1(X;t)], (35)

for all α1.

Proof. 

The relation (33) gives

Eα(X;t)S(t)=t[Ω(x)Ω(t)]α1Γ(α)f(x)m(x)dx.

By differentiating, we obtain

Eα(X;t)S(t)f(t)Eα(X;t)=λ(t)(α1)Γ(α1)Γ(α)t[Ω(x)Ω(t)]α2Γ(α1)f(x)m(x)dx.

Applying Γ(α)=(α1)Γ(α1) and using again (33),

Eα(X;t)S(t)f(t)Eα(X;t)=λ(t)Eα(X;t),

that is, (35) holds. □

The preceding theorem can be applied to present the following theorem:

Theorem 20.

If X is IFR (DFR), then Eα(X;t) is decreasing (increasing) for all α1.

Proof. 

The result is immediate for α=1 since Eα(X;t)=m(t) and since the IFR (DFR) property is stronger than the DMRL (IMRL) property. For all α>1, using relation (30), we have

Eα(X;t)()Eα1(X;t),

which validates the theorem by using Theorem 19. □

Let us define a new aging notion based on the FGCRE.

Definition 1.

The RV X has an increasing (decreasing) dynamic FGCRE of order α, and denote it by IDFEα(DDFEα) if Eα(X;t) is increasing (decreasing) in t.

We note that the IDFE0 and DDFE0 classes correspond to the IMRL (increasing MRL) and DMRL (decreasing MRL) classes, respectively. In the next theorem, we prove IDFEα1(DDFEα1) is a subclass of IDFEα(DDFEα) for all α1.

Lemma 2.

Let Eα(X;0)< for a fixed α1. Then

Eα(X;t)=1S(t)tEα1(X;x)f(x)dx. (36)

Under the assumptions of Lemma 2, Eα(X;t) is an absolutely continuous function. Furthermore, for α=0, then m(t)=E0(X;t) is also absolutely continuous under the hypothesis that μ<. Moreover, we have the following result.

Theorem 21.

If X is IDFEα1(IDFEα1), then X is IDFEα(IDFEα) for all α1.

Proof. 

Suppose that X is IDFEα1. Then, by using (36), we obtain

Eα(X;t)=1S(t)tEα1(X;x)f(x)dx=1S(t)tEα1(X;t)f(x)dx=Eα1(X;t),

for all t00. Then (35) yields Eα(X;t) and X is IDFEα. The proof is similarly carried out when X is DDFEα. □

From Theorem 21, we can conclude that

IDFEα1IDFEα2

and

DDFEα1DDFEα2

for all 1α1α2. An immediate consequence of the above relation is that

IMRLIDFEαandDMRLDDFEα

for all α0. We remark that Navarro et al. (2010) provided some examples showing that an RV X is IDGCRE1(DDGCRE1) but it is not IMRL (DMRL). However, Navarro and Psarrakos [24] by some counterexamples showed that X is neither IMRL (DMRL) nor IDGCRE1(DDGCRE1), but it is included in the class IDGCREα(DDGCREα) when α is an integer value. Hence, the result holds for all α1.

This section is closed by introducing the dynamic normalized version of the FGCRE as follows:

NEα(X;t)=Eα(X;t)m(t), (37)

for all t>0.

Theorem 22.

Let X have a finite normalized FGCRE NEα(X;t). If X is IMRL (DMRL), then NEα(X;t)()1 for all t>0.

Proof. 

Since X is IMRL (DMRL) based on the assumption, we have

m(x)m(t)()1,xt.

Therefore, from Equations (33) and (37), we obtain

NEα(X;t)=tm(x)m(t)fα(x|t)dx()tfα(x|t)dx=1,

from which we have the result. □

In Table 4, we give the dynamically normalized FGCREs for some distributions. For example, we present the dynamically normalized FGCRE of the Weibull distribution in Figure 3. We note that X is IMRL when k1 and X is DMRL when 0k1.

Table 4.

FGCREs, MRLs and normalized FGCREs for some distributions.

Distribution S(x) Parameters Eα(X;t) m(t) NEα(X;t)
Uniform(a,b) btba,0xb 0a<b (bt)2α+1 (bt)2 2α
Weibull(c,k) ecxk,x>0 c>0,k>0 Γ11/k(α+1,ctk)kckΓ(α+1) Γ11/k(1,ctk)kck Γ11/k(α+1,ctk)Γ(α+1)Γ11/k(1,ctk) *
Power(a,b,c) (btba)c,atb 0a<b,c>0 cα(bt)(c+1)α+1 (bt)(c+1) cc+1α
Pareto(a,b) aa+tb,x0 a>0,b>1 bα(a+t)(b1)α+1 (a+t)(b1) bb1α

* Γr(m,t)=0xm1(x+t)rexdx denotes the generalized gamma function.

Figure 3.

Figure 3

The dynamic normalized FGCRE for the Weibull distribution given in case (ii) of Table 4, with k=0.2 (left panel) and k=2 (right panel) as a function of t for various values of α=0.2,0.5,1,2,3.5.

Eventually, the inequalities given in (25) can be developed as

NEα(X;t)c(α)[NE(X;t)]α,if0α1c(α)[NE(X;t)]α,ifα1.

The inequalities given above are very useful when the dynamic FGCRE has a complicated form.

Author Contributions

Formal analysis, M.K.; Investigation, G.A.; Methodology, G.A. and M.K.; Project administration, G.A.; Resources, M.K.; Supervision, M.K.; Visualization, M.K.; Writing—original draft, G.A.; Writing—review & editing, M.K. All authors have read and agreed to the published version of the manuscript.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflict of interest.

Funding Statement

Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2022R226), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Footnotes

Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.Shannon C.E. A mathematical theory of communication. Bell Syst. Tech. 1948;27:379–423. doi: 10.1002/j.1538-7305.1948.tb01338.x. [DOI] [Google Scholar]
  • 2.Rao M., Chen Y., Vemuri B.C., Wang F. Cumulative residual entropy: A new measure of information. IEEE Trans. Inf. Theory. 2004;50:1220–1228. doi: 10.1109/TIT.2004.828057. [DOI] [Google Scholar]
  • 3.Asadi M., Zohrevand Y. On the dynamic cumulative residual entropy. J. Stat. Plan. Inference. 2007;137:1931–1941. doi: 10.1016/j.jspi.2006.06.035. [DOI] [Google Scholar]
  • 4.Navarro J., del Aguila Y., Asadi M. Some new results on the cumulative residual entropy. J. Stat. Plan. Inference. 2010;140:310–322. doi: 10.1016/j.jspi.2009.07.015. [DOI] [Google Scholar]
  • 5.Baratpour S. Characterizations based on cumulative residual entropy of first-order statistics. Commun. Stat. Methods. 2010;39:3645–3651. doi: 10.1080/03610920903324841. [DOI] [Google Scholar]
  • 6.Baratpour S., Rad A.H. Testing goodness-of-fit for exponential distribution based on cumulative residual entropy. Biometrika. 2012;41:1387–1396. [Google Scholar]
  • 7.Toomaj A., Sunoj S.M., Navarro J. Some properties of the cumulative residual entropy of coherent and mixed systems. J. Appl. Probab. 2017;54:379–393. doi: 10.1017/jpr.2017.6. [DOI] [Google Scholar]
  • 8.Di Crescenzo A., Kayal S., Meoli A. Fractional generalized cumulative entropy and its dynamic version. Commun. Nonlinear Sci. Numer. Simul. 2021;102:105899. doi: 10.1016/j.cnsns.2021.105899. [DOI] [Google Scholar]
  • 9.Xiong H., Shang P., Zhang Y. Fractional cumulative residual entropy. Commun. Nonlinear Sci. Numer. Simul. 2019;78:104879. doi: 10.1016/j.cnsns.2019.104879. [DOI] [Google Scholar]
  • 10.Psarrakos G., Economou P. On the generalized cumulative residual entropy weighted distributions. Commun. -Stat.-Theory Methods. 2017;46:10914–10925. doi: 10.1080/03610926.2016.1252402. [DOI] [Google Scholar]
  • 11.Toomaj A., Di Crescenzo A. Connections between weighted generalized cumulative residual entropy and variance. Mathematics. 2020;8:1072. doi: 10.3390/math8071072. [DOI] [Google Scholar]
  • 12.Shaked M., Shanthikumar J.G. Stochastic Orders. Springer Science and Business Media; New York, NY, USA: 2007. [Google Scholar]
  • 13.Baxter L.A. Reliability applications of the relevation transform. Nav. Res. Logist. 1982;29:323–330. doi: 10.1002/nav.3800290212. [DOI] [Google Scholar]
  • 14.Mehran F. Linear measures of income inequality. Econom. J. Econom. Soc. 1976:805–809. doi: 10.2307/1913446. [DOI] [Google Scholar]
  • 15.Ardakani O.M., Ebrahimi N., Soofi E.S. Ranking forecasts by stochastic error distance, information and reliability measures. Int. Stat. Rev. 2018;86:442–468. doi: 10.1111/insr.12250. [DOI] [Google Scholar]
  • 16.Asadi M., Ebrahimi N., Soofi E.S. Connections of Gini, Fisher, and Shannon by Bayes risk under proportional hazards. J. Appl. Probab. 2017;54:10–27. doi: 10.1017/jpr.2017.51. [DOI] [Google Scholar]
  • 17.Oakes D., Dasu T. A note on residual life. Biometrika. 1990;77:409–410. doi: 10.1093/biomet/77.2.409. [DOI] [Google Scholar]
  • 18.Wang S. Insurance pricing and increased limits ratemaking by proportional hazards transforms. Insur. Math. Econ. 1995;17:43–54. doi: 10.1016/0167-6687(95)00010-P. [DOI] [Google Scholar]
  • 19.Fernandez-Ponce J.M., Kochar S.C., Muñoz-Perez J. Partial orderings of distributions based on right-spread functions. J. Appl. Probab. 1998;35:221–228. doi: 10.1239/jap/1032192565. [DOI] [Google Scholar]
  • 20.Ebrahimi N. How to measure uncertainty in the residual life time distribution. Sankhyā Indian J. Stat. Ser. A. 1996;58:48–56. [Google Scholar]
  • 21.Gupta R.C. On the monotonic properties of the residual variance and their applications in reliability. J. Stat. Plan. Inference. 1987;16:329–335. doi: 10.1016/0378-3758(87)90085-1. [DOI] [Google Scholar]
  • 22.Gupta R.C., Kirmani S.N.U.A., Launer R.L. On life distributions having monotone residual variance. Probab. Eng. Informational Sci. 1987;1:299–307. doi: 10.1017/S0269964800000073. [DOI] [Google Scholar]
  • 23.Gupta R.C., Kirmani S.N.U.A. Closure and monotonicity properties of nonhomogeneous poisson processes and record values. Probab. Eng. Inform. Sci. 1988;2:475–484. doi: 10.1017/S0269964800000188. [DOI] [Google Scholar]
  • 24.Navarro J., Psarrakos G. Characterizations based on generalized cumulative residual entropy functions. Commun. -Stat.-Theory Methods. 2017;46:1247–1260. doi: 10.1080/03610926.2015.1014111. [DOI] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.


Articles from Entropy are provided here courtesy of Multidisciplinary Digital Publishing Institute (MDPI)

RESOURCES