Skip to Content
MathematicsMathematics
  • Article
  • Open Access

5 July 2026

25 Pages

Tsallis Entropy Measures for Concomitants of Generalized Order Statistics with Applications in Image Segmentation and Reliability Analysis

,
and
1
Department of Statistics and Operations Research, College of Science, King Saud University, Riyadh 11451, Saudi Arabia
2
School of Statistics, University of Minnesota, Twin Cities, MN 55455, USA
3
Department of Mathematics, Faculty of Science, Zagazig University, Zagazig 44519, Egypt
*
Author to whom correspondence should be addressed.

Abstract

This paper develops a general framework for Tsallis entropy (TsE) and cumulative residual Tsallis entropy (CRTsE) for concomitants of generalized order statistics under the Cambanis family of bivariate distributions. Explicit closed-form expressions and alternative representations for TsE and its cumulative residual counterparts, including a unique formulation of the alternative CRTsE, are derived. Various structural properties are established, including symmetry relations between low- and high-rank concomitants, as well as connections with classical submodels such as order statistics and record values. A nonparametric estimator for the CRTsE is proposed; its mean, variance, and consistency properties are investigated analytically and through extensive Monte Carlo simulations. The theoretical framework is further illustrated through two application domains: reliability assessment of real bivariate system data, and histogram-based image segmentation via a rank-sensitive Tsallis-thresholding scheme. The proposed methodology constitutes a flexible, dependence-aware generalization of classical Shannon-based entropy measures and is particularly advantageous for systems exhibiting nonlinear dependence, tail sensitivity, or non-extensive behavior.

1. Introduction

Multivariate statistical analysis, especially in the fields of information theory, reliability theory, and survival analysis, relies heavily on the modeling of dependence patterns between random variables (RVs). One classical approach that captures weak types of dependency in a basic yet analytically tractable model is the Farlie–Gumbel–Morgenstern (FGM) family of bivariate distributions. With the FGM family, which was first introduced by Farlie [1] and later expanded by Gumbel [2] and Morgenstern [3], positive and negative dependencies can be modeled with a single association parameter, and closed-form formulations for marginal and joint distributions can be preserved. But because the dependence parameter in the standard FGM model may only take values within a certain range, it cannot capture really strong dependencies. A number of broad statements have been put forth to overcome this restriction. Notable extensions include the Cambanis family (see [4,5]), which expands the FGM structure to include a broader class of copula-type functions (see [6]). These functions are able to better simulate a larger variety of dependencies, such as those in ranking data scenarios and dependability models. The distribution function (DF) of the Cambanis family, represented as CM ( ζ 1 , ζ 2 ) , is expressed as follows:
C S , T ( s , t ; ζ ̲ ) = C S ( s ) C T ( t ) 1 + ζ 1 C ¯ T ( t ) + ζ 2 C ¯ S ( s ) C ¯ T ( t ) ,
where C S ( s ) and C T ( t ) are DFs of RVs S and T , respectively, while C ¯ S ( s ) = 1 − C S ( s ) and C ¯ T ( t ) = 1 − C T ( t ) are the survivals functions (SFs) of S and T , respectively. Here, we have the following probability density function (PDF):
ℵ S , T ( s , t ; ζ ̲ ) = ℵ S ( s ) ℵ T ( t ) 1 + ζ 1 ( 1 − 2 C T ( t ) + ζ 2 ( 1 − 2 C S ( s ) ( 1 − 2 C T ( t ) ,
where ℵ S ( s ) and ℵ T ( t ) are PDFs of S and T , respectively. Cambanis [4] showed that the admissible parameter space is
Θ = ζ : 1 + ζ 1 + ζ 2 ≥ 0 ; 1 − ζ 1 − ζ 2 ≥ 0 ; 1 − ζ 1 + ζ 2 ≥ 0 ; 1 + ζ 1 − ζ 2 ≥ 0 .
Several papers have studied this flexible model; see, for example, [7,8,9,10]. Information measurements are one of the key methods for addressing statistical modeling uncertainties and variability. This is notably true in reliability analysis, survival research, and image processing. However, differential entropy H ( S ) is commonly utilized in dependability analysis, despite its well-known issues. It does not have a natural SF meaning and depends on the PDF, which may not exist or be hard to estimate. Rao et al. [11] introduced the cumulative residual entropy (CRE), a new uncertainty measure based on the SF of S:
ξ ( S ) = − ∫ 0 ∞ C ¯ S ( s ) log C ¯ S ( s ) d s ,
The Boltzmann–Gibbs–Shannon formulation has long been used to estimate entropy, a key notion in thermodynamics, information theory, and statistical mechanics. On the other hand, reliable modeling using standard entropy is frequently not possible for complex systems that display features like multifractal structures, memory effects, or long-range interactions. Tsallis [12] proposed what is now called Tsallis entropy (TsE), a generalized entropy measure, to overcome these shortcomings. This measure is defined for the continuous RV S as
T s E ( S ) = 1 τ − 1 1 − ∫ 0 ∞ ℵ S ( s ) τ d s ,
where 0 < τ ≠ 1 , and if τ ⟶ 1 , then T s E ( S ) ⟶ H ( S ) . Sati and Gupta [13] proposed the cumulative residual Tsallis entropy (CRTsE) of order τ (cf. [14]) as
Ψ ( S ) = 1 τ − 1 1 − ∫ 0 ∞ C ¯ S ( s ) τ d s ,
when τ ⟶ 1 , then Ψ ( S ) ⟶ ξ ( S ) . It is instructive to situate TsE within the broader landscape of generalized entropy measures. Rényi entropy of order τ is defined as H τ R ( S ) = 1 1 − τ log ∫ [ ℵ S ( s ) ] τ d s . Both Rényi and Tsallis entropies share the same underlying functional ∫ [ ℵ S ( s ) ] τ d s ; they are related by TsE ( S ) = 1 − exp [ ( 1 − τ ) H τ R ( S ) ] τ − 1 , so that for τ ≠ 1 the two measures carry equivalent information about the distribution. The appearance of a logarithm in the Rényi scale compresses the information and makes the measure additive for independent systems. This additivity is technically convenient but limits the flexibility of the model for complicated, dependent variables. On the contrary, the absence of the logarithm in the Tsallis formulation maintains a straight polynomial relation with the density kernel and so permits a simple non-additive structure. TsE is non-additive (or non-extensive) for independent systems, satisfying TsE ( S , T ) = TsE ( S ) + TsE ( T ) + ( 1 − τ ) TsE ( S ) TsE ( T ) , which makes it particularly advantageous for modeling systems with long-range dependence or power-law behavior properties that are relevant to the concomitant framework developed in this paper. Rajesh and Sunoj [15] introduced an alternative measure for CRTE (ACRTE) as follows:
ξ τ ( S ) = 1 τ − 1 ∫ 0 ∞ ( C ¯ S ( s ) − C ¯ S ( s ) τ ) d s , η > 0 , η ≠ 1 .
Kamps [16] developed the generalized order statistics (GdOSs) model as an all-encompassing framework for ascendingly ordered RVs. The GdOSs model includes many important models of ordered RVs, as seen in Table 1. The RVs S ( r , n , m ˜ , k ) , r = 1 , 2 , … , n are called GdOS based on absolutely continuous DF C S with the PDF ℵ S , if their joint PDF (JPDF) has the form
ℵ 1 , … , n : n ( m ˜ , k ) ( s 1 , … , s n ) = ∏ j = 1 n γ j ∏ j = 1 n − 1 C ¯ S γ j − γ j + 1 − 1 ( s j ) ℵ S ( s j ) C ¯ S γ n − 1 ( s n ) f S ( s n ) ,
where C − 1 ( 0 ) ≤ s 1 ≤ … ≤ s n ≤ C − 1 ( 1 ) . The parameters γ 1 , … , γ n are defined by γ n = k > 0 , γ r = k + n − r + ∑ j = r n − 1 m j , r = 1 , … , n − 1 and m ˜ = ( m 1 , m 2 , … , m n − 1 ) ∈ R . The PDF of the rth GdOS is given by (cf. Kamps and Cramer [17])
ℵ S ( r , n , m ˜ , k ) ( s ) = η r − 1 ∑ i = 1 r a i ( r ) C ¯ S γ i − 1 ( s ) ℵ S ( s ) , s ∈ R , 1 ≤ r ≤ n ,
where η r − 1 = ∏ i = 1 r γ i , a i ( r ) = ∏ j = 1 j ≠ i r 1 γ j − γ i , 1 ≤ i ≤ r ≤ n .  Table 1 presents a unified view of several classical and generalized models as submodels within the versatile framework of GdOSs.
Table 1. Examples of submodels contained in the GdOS model.
The revived interest in concomitants may be attributed to their significance in selection processes and prediction problems. Yang [18] formulated the comprehensive theory of concomitants of order statistics (CTOSs). The topic has been studied by many researchers, see [7,8,19,20]. Let ( S i , T i ) , i = 1 , 2 , … , n , be a random sample from a bivariate DF C S , T ( s , t ) . The GdOSs of the S-variate that are associated with the GdOSs for the T sample are called concomitants of GdOSs (CGdOSs) and are denoted by T [ 1 , n , m ˜ , k ] , T [ 2 , n , m ˜ , k ] , … , T [ n , n , m ˜ , k ] . The PDF of the concomitant of rth GdOS is given by (see [8,20])
ℵ [ r , n , m ˜ , k ] ( t ) = ∫ 0 ∞ ℵ T | S ( t | s ) ℵ S ( r , n , m ˜ , k ) ( s ) d s ,
where ℵ T | S ( t | s ) is the conditional PDF of T given S . A broad investigation on Tsallis measures under CGdOS is presented in this paper, based on the CM ( ζ 1 , ζ 2 ) .
The remainder of this paper is organized as follows. Section 2 introduces the framework of CGdOSs under the CM ( ζ 1 , ζ 2 ) family of bivariate distributions and derives the main results for TsE, including explicit representations and fundamental properties. Section 3 is devoted to the development of CRTsE and its alternative formulation, where several theoretical properties are established. Also, a nonparametric estimator is proposed, and its statistical characteristics, including mean and variance, are investigated with a comprehensive simulation study to evaluate the finite-sample performance of the proposed estimators under different parameter settings. Section 4 illustrates the practical applicability of the proposed methodology through real data analysis in terms of reliability and an image segmentation application based on TsE. Section 5 concludes the report with a summary and research proposals.

Motivation

The nonlinear dependence, tail phenomena, and higher-order interactions in modern data structures are much more complicated than the traditional practice in entropy measures. Independent frameworks are not practical in many applications, such as reliability engineering, survival analysis, and image processing, where observations are often dependent and presented in a sequential or ranked manner. The Shannon entropy and its cumulative residual counterpart have been widely used to quantify uncertainty, but these approaches may not provide enough flexibility to model systems with long-range dependence or non-extensive behavior. In this context, TsE provides a more flexible alternative, with an extra parameter that allows it to adjust its sensitivity to rare events and distribution tails. Simultaneously, CGdOSs offer a flexible toolset that provides a framework for dealing with dependent and ordered data generated by bivariate and multivariate models. Prompted by the necessity to combine structured dependence models with flexible entropy measures, this paper proposes a general framework for Tsallis-based uncertainty quantification in conjunction with at least one CGdOSs, particularly under the CM ( ζ 1 , ζ 2 ) family of distributions. This coupling between existing notions of entropy would not only generalize their properties but also allow them greater applicability in modeling complex systems found in nature. Over the past few years, entropy-based methods have continued to expand their presence in various aspects of image processing, including, but not limited to, change detection, target repair segmentation, automatic thresholding, and others; an area where uncertainty becomes fundamental for discriminating structures from noise. The classic Shannon-entropy-based approaches gained widespread use due to their simplicity and strong theoretical grounding, but tend to suffer from limited robustness to complex images (i.e., those with noise, low contrast, or heavy-tailed intensity distributions). For these cases, TsE is a better-suited, non-additive alternative with an adjustable parameter that allows fine-tuning of sensitivity to rare events and local intensity fluctuations. Due to its adjustable nature, TsE is widely used to enhance segmentation quality and retain image details, especially for rank-based or contextual thresholding techniques. The inclusion of TsE into statistical structures, such as the CGdOSs under various dependence-generating models, offers a promising path toward more precise image processing with knowledge of dependencies.

2. Tsallis Entropy for CGdOSs Based on CM ( ζ 1 , ζ 2 ) Family

In this section, we derive the CGdOS under the CM ( ζ 1 , ζ 2 ) family. Clear representations of well-known submodels within this category are provided to demonstrate the versatility and relevance of the proposed framework. The TsE is then articulated inside the framework of CGdOS, facilitating the quantification of uncertainty and information for dependent RVs dictated by the Cambanis structure.
Theorem 1. 
Let T [ r , n , m ˜ , k ] represent CGdOSs from CM ( ζ 1 , ζ 2 ) family. Then, the PDF, CDF, and SF of T [ r , n , m ˜ , k ] respectively are
ℵ [ r , n , m ˜ , k ] ( t ) = ℵ T ( t ) 1 + ζ ( m ˜ , k ) ( r , n ) ( 1 − 2 C T ( t ) ) ,
C [ r , n , m ˜ , k ] ( t ) = C T ( t ) 1 + ζ ( m ˜ , k ) ( r , n ) C ¯ T ( t ) ,
C ¯ [ r , n , m ˜ , k ] ( t ) = C ¯ T ( t ) 1 − ζ ( m ˜ , k ) ( r , n ) C T ( t ) ,
where ζ ( m ˜ , k ) ( r , n ) = ζ 1 + ζ 2 2 η r − 1 ∑ i = 1 r a i ( r ) γ i + 1 − 1 ,   η r − 1 = ∏ i = 1 r γ i ,   a i ( r ) = ∏ j = 1 j ≠ i r 1 γ j − γ i ,   1 ≤ i ≤ r ≤ n .
Proof. 
Based on (2), and (7), we then have
ℵ [ r , n , m ˜ , k ] ( t ) = ∫ 0 ∞ ℵ T | S ( t | s ) ℵ S ( r , n , m ˜ , k ) ( s ) d s = ∫ 0 ∞ ℵ T ( t ) 1 + ζ 1 ( 1 − 2 C T ( t ) ) + ζ 2 ( 1 − 2 C S ( s ) ) ( 1 − 2 C T ( t ) ) × η r − 1 ∑ i = 1 r a i ( r ) C ¯ S γ i − 1 ( s ) ℵ S ( s ) d s = η r − 1 ∑ i = 1 r a i ( r ) ∫ − ∞ ∞ ℵ T ( t ) 1 + ( 1 − 2 C T ( t ) ) ( ζ 1 + ζ 2 ( 1 − 2 C S ( s ) ) ) × C ¯ S γ i − 1 ( s ) ℵ S ( s ) d s = ℵ T ( t ) 1 + ζ ( m ˜ , k ) ( r , n ) ( 1 − 2 C T ( t ) ) .
where
ζ ( m ˜ , k ) ( r , n ) = ζ 1 + ζ 2 η r − 1 ∑ i = 1 r a i ( r ) ∫ 0 ∞ ( 2 C ¯ S ( s ) − 1 ) C ¯ S γ i − 1 ( s ) ℵ S ( s ) d s = ζ 1 + ζ 2 2 η r − 1 ∑ i = 1 r a i ( r ) ∫ − ∞ ∞ C ¯ S γ i ℵ S ( s ) d s − 1 = ζ 1 + ζ 2 2 η r − 1 ∑ i = 1 r a i ( r ) ∫ 0 1 u γ i d u − 1 = ζ 1 + ζ 2 2 η r − 1 ∑ i = 1 r a i ( r ) γ i + 1 − 1 .
□
Three important subclasses of concomitants deserve special attention. First, when m ˜ = 0 and k = 1 , we obtain the concomitants of order statistics (CTOSs) T [ r , n , 0 , 1 ] . Second, when m ˜ = − 1 and k = 1 , we obtain the concomitants of record values (ConRec) T [ n , − 1 , 1 ] ( u ) (upper) and T [ n , − 1 , 1 ] ( l ) (lower). Third, when all m j are equal to a constant m (with m > − 1 ), we obtain the concomitants of m-generalized order statistics (m-GdOSs) T [ r , n , m , k ] . Remark 1 below provides explicit density formulas for each of these three cases.
Remark 1. 
The framework of CGdOSs from the CM family provides a unified structure that encompasses several well-known models in statistical theory as special cases. Among the most prominent subclasses are the following:
1. 
Putting m ˜ = 0 ,   k = 1 , in ζ ( m ˜ , k ) ( r , n ) , we get the PDF of CTOSs based CM family as follows:
ℵ [ r , n , 0 , 1 ] ( t ) = ℵ T ( t ) 1 + ζ 1 + ζ 2 ( n − 2 r + 1 n + 1 ) ( 1 − 2 C T ( t ) ) .
2. 
Putting m ˜ = − 1 ,   k = 1 , in ζ ( m ˜ , k ) ( r , n ) , we get the PDFs of upper and lower ConRec, respectively, as follows:
ℵ [ n , − 1 , 1 ] ( u ) ( t ) = ℵ T ( t ) [ 1 + ( ζ 1 + ζ 2 ( 2 − ( n − 1 ) − 1 ) ) ( 1 − 2 C T ( t ) ) ] ,
ℵ [ n , − 1 , 1 ] ( l ) ( t ) = ℵ T ( t ) [ 1 + ( ζ 1 + ζ 2 ( 1 − 2 − ( n − 1 ) ) ) ( 1 − 2 C T ( t ) ) ] .
3. 
To get the m-GdOSs, taking m ˜ = m . The PDF of concomitant of m-GdOSs based CM family is given by
ℵ [ r , n , m , k ] ( t ) = ℵ T ( t ) 1 + ζ 1 + ζ 2 2 ∏ i = 1 r γ i γ i + 1 − 1 ( 1 − 2 C T ( t ) ) .
Theorem 2 (Quantile-based TsE).
For the CGdOS T [ r , n , m ˜ , k ] from the CM ( ζ 1 , ζ 2 ) family with Q T ( u ) = C T − 1 ( u ) and quantile density function q T ( u ) = Q T ′ ( u ) . Then, the TsE of T [ r , n , m ˜ , k ] is
TsE [ r , n , m ˜ , k ] = 1 τ − 1 1 − E U 1 + ζ ( m ˜ , k ) ( r , n ) ( 1 − 2 U ) τ q T ( U ) τ − 1 ,
where U ∼ Uniform ( 0 , 1 ) , 0 < τ ≠ 1 , and
ζ ( m ˜ , k ) ( r , n ) = ζ 1 + ζ 2 2 η r − 1 ∑ i = 1 r a i ( r ) γ i + 1 − 1 .
Proof. 
From the TsE definition (3) and the PDF of the CGdOS (8), we obtain
TsE [ r , n , m ˜ , k ] = 1 τ − 1 1 − ∫ 0 ∞ ℵ T ( t ) 1 + ζ ( m ˜ , k ) ( r , n ) 1 − 2 C T ( t ) τ d t .
Setting u = C T ( t ) , we have d t = q T ( u ) d u . Hence,
ℵ T ( t ) 1 + ζ ( m ˜ , k ) ( r , n ) 1 − 2 C T ( t ) τ d t = ℵ T ( Q T ( u ) ) τ 1 + ζ ( m ˜ , k ) ( r , n ) ( 1 − 2 u ) τ q T ( u ) d u = 1 + ζ ( m ˜ , k ) ( r , n ) ( 1 − 2 u ) τ q T ( u ) τ − 1 d u .
Substituting into the integral and recognizing the expectation with respect to U ∼ Uniform ( 0 , 1 ) completes the proof.    □
Lemma 1. 
For any ( ζ 1 , ζ 2 ) ∈ Θ and u ∈ [ 0 , 1 ] ,
− 1 ≤ ζ ( m ˜ , k ) ( r , n ) ( 1 − 2 u ) ≤ 1 ,
so that 1 + ζ ( m ˜ , k ) ( r , n ) ( 1 − 2 u ) ≥ 0 for all u ∈ [ 0 , 1 ] .
Proof. 
From Θ , we have | ζ 1 + ζ 2 | ≤ 1 and | ζ 1 − ζ 2 | ≤ 1 . Since λ : = η r − 1 ∑ i = 1 r a i ( r ) γ i + 1 ∈ [ 0 , 1 ] , we can write
ζ ( m ˜ , k ) ( r , n ) = λ ( ζ 1 + ζ 2 ) + ( 1 − λ ) ( ζ 1 − ζ 2 ) ∈ [ − 1 , 1 ] .
For u ∈ [ 0 , 1 ] , | 1 − 2 u | ≤ 1 , so | ζ ( m ˜ , k ) ( r , n ) ( 1 − 2 u ) | ≤ 1 . Adding 1 gives the result.    □
Theorem 3 (Another representation of TsE).
Let T [ r , n , m ˜ , k ] be the CGdOSs from CM ( ζ 1 , ζ 2 ) family. Then the TsE of T [ r , n , m ˜ , k ]
TsE [ r , n , m ˜ , k ] = 1 τ − 1 1 − ∑ i = 0 N ( τ ) N ( τ ) i ζ ( m ˜ , k ) ( r , n ) i E U ( 1 − 2 U ) i q T ( U ) τ − 1 ,
where N ( τ ) = τ if τ ∈ Z + and N ( τ ) = ∞ otherwise.
Proof. 
Based on (8) and (3), we then have
T s E [ r , n , m ˜ , k ] ( t ) = 1 τ − 1 1 − ∫ 0 ∞ ℵ [ r , n , m ˜ , k ] ( t ) τ d t = 1 τ − 1 1 − ∫ 0 ∞ ℵ T ( t ) 1 + ζ ( m ˜ , k ) ( r , n ) ( 1 − 2 C T ( t ) ) τ d t .
Expanding ( 1 + ζ ( m ˜ , k ) ( r , n ) ( 1 − 2 C T ( t ) ) ) τ via the generalized binomial. Then,
T s E [ r , n , m ˜ , k ] ( t ) = 1 τ − 1 1 − ∑ i = 0 N ( τ ) N ( τ ) i ζ ( m ˜ , k ) ( r , n ) i ∫ 0 ∞ ℵ T ( t ) τ ( 1 − 2 C T ( t ) ) i d t .
After taking C T ( t ) = u . , we then have
T s E [ r , n , m ˜ , k ] ( t ) = 1 τ − 1 1 − ∑ i = 0 N ( τ ) N ( τ ) i ζ ( m ˜ , k ) ( r , n ) i ∫ 0 1 ℵ T ( C − 1 ( u ) ) τ − 1 ( 1 − 2 u ) i d u .
Recognizing the integral as an expectation with respect to U ∼ Uniform ( 0 , 1 ) completes the proof.    □
Theorem 4. 
Let τ > 0 with τ ∉ Z + , and let ( ζ 1 , ζ 2 ) ∈ Θ . For u ∈ [ 0 , 1 ] , define z ( u ) = ζ ( m ˜ , k ) ( r , n ) ( 1 − 2 u ) . Then for every u ∈ [ 0 , 1 ] ,
( 1 + z ( u ) ) τ = ∑ i = 0 ∞ τ i ζ ( m ˜ , k ) ( r , n ) i ( 1 − 2 u ) i ,
where the series converges absolutely for u ∈ ( 0 , 1 ) and conditionally for u ∈ { 0 , 1 } when | ζ ( m ˜ , k ) ( r , n ) | = 1 ; if τ ∈ Z + , the series terminates at i = τ . Moreover, if the marginal distribution satisfies the condition
I τ : = E U 1 q T ( U ) τ − 1 = ∫ 0 1 d u q T ( u ) τ − 1 < ∞ ,
then the expectation in Theorem 3 is finite and the interchange of sum and integral is justified.
Proof. 
By Lemma 1, | ζ ( m ˜ , k ) ( r , n ) | ≤ 1 and | 1 − 2 u | ≤ 1 , hence | z ( u ) | ≤ 1 . For u ∈ ( 0 , 1 ) we have | z ( u ) | < 1 ; the binomial series then converges absolutely because τ i ∼ C / i τ + 1 and ∑ i − ( τ + 1 ) < ∞ for τ > 0 . For u = 0 or u = 1 , if  | ζ | < 1 absolute convergence holds as before, and if | ζ | = 1 then z ( u ) = ± 1 and τ i ∼ ( − 1 ) i + 1 τ / i τ + 1 ; the alternating series test gives conditional convergence, and Abel’s theorem ensures the sum equals ( 1 ± 1 ) τ . If τ ∈ Z + , then τ i = 0 for i > τ , so the series terminates. Finally, since | 1 − 2 U | i ≤ 1 , we have | ( 1 − 2 U ) i / q T ( U ) τ − 1 | ≤ 1 / q T ( U ) τ − 1 . The condition I τ < ∞ guarantees integrability, and the dominated convergence theorem justifies the interchange of sum and expectation in Theorem 3.    □
Remark 2. 
The interchange of summation and integration in the proof of Theorem 3 is justified as follows. By Lemma 1, | 1 + ζ ( m ˜ , k ) ( r , n ) ( 1 − 2 u ) | ≤ 2 uniformly in u. Hence, each partial sum of the binomial expansion is bounded by 2 τ [ ℵ T ( C T − 1 ( u ) ) ] τ uniformly in u, and the integrability condition I τ < ∞ provides a dominating integrable function.
Proposition 1. 
For the CTOSs T [ r , n , 0 , 1 ] . Then
T s E [ r , n , 0 , 1 ] ( t ; ζ 1 , ζ 2 ) = T s E [ n − r + 1 , n , 0 , 1 ] ( t ; ζ 1 , − ζ 2 )
Proof. 
Based on item 1 in Remark 1, and (3), we then have
T E [ n − r + 1 , n , 0 , 1 ] ( t ; ζ 1 , − ζ 2 ) = 1 τ − 1 1 − ∫ 0 ∞ ℵ T ( t ) 1 + ζ 1 − ζ 2 ( n − 2 ( n − r + 1 ) + 1 n + 1 ) ( 1 − 2 C T ( t ) ) τ d t = 1 τ − 1 1 − ∫ 0 ∞ ℵ T ( t ) 1 + ζ 1 + ζ 2 ( n − 2 r + 1 n + 1 ) ( 1 − 2 C T ( t ) ) τ d t . = T s E [ r , n , 0 , 1 ] ( t ; ζ 1 , ζ 2 ) .
   □
Proposition 2. 
For the ConRec T [ r , n , − 1 , 1 ] . Then
T s E [ n , − 1 , 1 ] ( u ) ( t ; ζ 1 , ζ 2 ) = T s E [ n , − 1 , 1 ] ( l ) ( t ; ζ 1 , − ζ 2 ) .
Proof. 
According to item 2 in Remark 1, we have
T s E [ n , − 1 , 1 ] ( u ) ( t ; ζ 1 , ζ 2 ) = 1 τ − 1 1 − ∫ 0 ∞ ℵ T ( t ) 1 + ζ 1 + ζ 2 ( 2 − ( n − 1 ) − 1 ) ( 1 − 2 C T ( t ) ) τ d t = 1 τ − 1 1 − ∫ 0 ∞ ℵ T ( t ) 1 + ζ 1 − ζ 2 ( 1 − 2 − ( n − 1 ) ) ( 1 − 2 C T ( t ) ) τ d t = T s E [ n , − 1 , 1 ] ( l ) ( t ; ζ 1 , − ζ 2 ) .
□
Example 1. 
Let S and T be exponentially distributed (CM-ED) RVs with bivariate DF:
C S , T ( s , t ; ζ ̲ ) = ( 1 − exp ( − s θ 1 ) ) ( 1 − exp ( − t θ 2 ) ) 1 + ζ 1 exp ( − t θ 2 ) + ζ 2 exp ( − s θ 1 ) exp ( − t θ 2 ) , s , t , θ 1 , θ 2 > 0 .
From (12), we get n the TsE of T [ r , n , m ˜ , k ] as follows:
T s E [ r , n , m ˜ , k ] ( t ) = 1 τ − 1 1 − ∑ i = 0 N ( τ ) ∑ j = 0 i N ( τ ) i i j ( − 2 ) j ζ ( m ˜ , k ) ( r , n ) i θ 2 1 − τ β j + 1 , τ .
Example 2. 
Let S and T be uniformly distributed from CM family (CM-UD) RVs with bivariate DF:
C S , T ( s , t ) = s t θ 1 θ 2 1 + ζ 1 1 − t θ 2 + ζ 2 1 − s θ 1 1 − t θ 2 , 0 < s < θ 1 , 0 < t < θ 2 .
The TsE of T [ r , n , m ˜ , k ] based on CM-UD family is
T s E [ r , n , m ˜ , k ] = 1 τ − 1 1 − ∑ i = 0 N ( τ ) N ( τ ) i ζ i ( − 1 ) i + 1 θ 2 τ − 1 2 ( i + 1 ) .
Example 3. 
Let the DF bivariate CM Weibull distribution (CM-WD) be
C S , T ( s , t ) = ( 1 − e − ( s θ 1 ) β 1 ) ( 1 − e − ( s θ 2 ) β 2 ) [ 1 + ζ 1 ( e − ( t θ 2 ) β 2 ) + ζ 2 ( e − ( s θ 1 ) β 1 ) ( e − ( t θ 2 ) β 2 ) ] , 0 < s , t , θ 1 , θ 2 , β 1 , β 2 .
The TsE of T [ r , n , m ˜ , k ] based on CM-WD family is
T s E [ r , n , m ˜ , k ] = 1 τ − 1 { 1 − ∑ i = 0 N ( τ ) ∑ j = 0 i ∑ k = 0 j N ( τ ) i i j j k ( − 1 ) k ( − 2 ) j ζ i × β 2 τ − 1 θ 2 − ( τ − 1 ) Γ ( β 2 − 1 ) τ + 1 β 2 ( τ + k ) − ( β 2 τ − τ + 1 ) / β 2 } .
The TsE behavior under CM-ED for various dependent structures of data is shown in Figure 1 and Figure 2, and is based on CTOS and ConRec. TsE decreases monotonically, demonstrating the reaction of entropy to τ . Higher r values and dependency parameters ( ζ 1 , ζ 2 ) lead to greater initial TsE values. CTOS assembles these values more quickly than ConRec. As seen in Figure 2, TsE for upper contemporaneous record values is more sensitive to parameter changes, leading to a larger spread in the curves. Higher-entropy scenarios for various dependent data structures and CM-ED predictive capabilities are also supported by different results. Table 2 and Table 3 are for CTOS TsE, with distinct considerations for how data is allocated, along with their respective parameters. Table 2 shows that TsE increases with r when ζ 2 > 0 . The sign ζ 2 < 0 means that TsE decreases with r. For negative values of ζ 2 , TsE is positively correlated with rank at lower ranks and negatively correlated with rank at higher ranks. The converse is true when ζ 2 is positive. As shown by Table 3, for uniform distributions, TsE has nice symmetry at r = n / 2 thanks to the fact that its entropy values are a constant at the median order statistic with respect to permutations. In contrast, the effect of ζ 2 is even less impactful than that induced by the exponential scenario, such that variations in ζ 2 primarily influence limits ( r = 1 and r = n ). Deduced properties and relationships:
  • T s E [ r , n , 0 , 1 ] ( t ; ζ 1 , ζ 2 ) = T s E [ n − r + 1 , n , 0 , 1 ] ( t ; ζ 1 , − ζ 2 )
  • The exponential case is sensitive to extreme values, leading to sharper variations in T s E , while the uniform case exhibits smoother behavior due to its bounded support.
  • For fixed n, T s E achieves its maximum at central ranks and minimum at the extremes ( r = 1 and r = n ) in CM-UD.
Figure 1. TsE behavior in CTOSs under CM-ED at n = 20 .
Figure 2. T s E in upper ConRec-based CM-ED.
Table 2. T s E [ r , n , 0 , 1 ] ( t ; ζ 1 , ζ 2 ) for the CM-ED.
Table 3. T s E [ r , n , 0 , 1 ] ( t ; ζ 1 , ζ 2 ) for the CM-UD.

3. Two Formulations of CRTsE

In this section, we introduce and analyze the CRTsE within the framework of CGdOS. Using the Cambanis family of bivariate distributions, we derive explicit formulas for CRTsE and explore important properties such as symmetry and lower bound. Additionally, we investigate nonparametric estimators for CRTsE based on the CM family. Furthermore, the mean and variance of the empirical CRTsE are deduced.

3.1. ACRTsE in CGdOSs from CM Family

We now develop the results associated with the alternative formulation of the CRTsE introduced in (5). The following theorem and illustrative examples are entirely devoted to this alternative version of the CRTE measure.
Theorem 5. 
Let T [ r , n , m ˜ , k ] be the CGdOS from CM ( ζ 1 , ζ 2 ) with SF C ¯ T ( t ) = 1 − C T ( t ) and PDF ℵ T ( t ) . Then the ACRTsE of T [ r , n , m ˜ , k ] is given by
ξ τ T [ r , n , m ˜ , k ] = 1 τ − 1 E U ( 1 − ζ U ) ( 1 − U ) ℵ T ( C T − 1 ( U ) ) − ∑ i = 0 N ( τ ) N ( τ ) i ( − ζ ) i E U U i ( 1 − U ) τ ℵ T ( C T − 1 ( U ) ) ,
where ζ = ζ ( m ˜ , k ) ( r , n ) = ζ 1 + ζ 2 2 η r − 1 ∑ i = 1 r a i ( r ) γ i + 1 − 1 , U ∼ Uniform ( 0 , 1 ) , N ( τ ) = ∞ if τ is non-integer, and  N ( τ ) = τ if τ is integer, η r − 1 = ∏ i = 1 r γ i , and  a i ( r ) = ∏ j = 1 j ≠ i r 1 γ j − γ i , γ i = k + n − i + ∑ j = i n − 1 m j for i = 1 , … , n .
Proof. 
Using (5), and SF (10), we have
ξ τ T [ r , n , m ˜ , k ] = 1 τ − 1 ∫ 0 ∞ C ¯ [ r , n , m ˜ , k ] ( t ) − C ¯ [ r , n , m ˜ , k ] ( t ) τ d t = 1 τ − 1 ∫ 0 ∞ C ¯ T ( t ) ( 1 − ζ C T ( t ) ) − C ¯ T ( t ) ( 1 − ζ C T ( t ) ) τ d t .
Suppose u = C T ( t ) . Then,
ξ τ T [ r , n , m ˜ , k ] = 1 τ − 1 ∫ 0 1 ( 1 − u ) ( 1 − ζ u ) − ( 1 − u ) ( 1 − ζ u ) τ d u ℵ T ( C T − 1 ( u ) ) = 1 τ − 1 ∫ 0 1 ( 1 − u ) ( 1 − ζ u ) ℵ T ( C T − 1 ( u ) ) d u − ∫ 0 1 [ ( 1 − u ) ( 1 − ζ u ) ] τ ℵ T ( C T − 1 ( u ) ) d u .
The second integral requires expanding ( 1 − ζ u ) τ via the generalized binomial theorem. By the condition I τ < ∞ and Theorem 4. Thus,
ξ τ = 1 τ − 1 [ ∫ 0 1 ( 1 − u ) ( 1 − ζ u ) ℵ T ( C T − 1 ( u ) ) d u − ∑ i = 0 N ( τ ) N ( τ ) i ( − ζ ) i ∫ 0 1 u i ( 1 − u ) τ ℵ T ( C T − 1 ( u ) ) d u ] .
Recognizing the integrals as expectations with respect to U ∼ Uniform ( 0 , 1 ) ,
∫ 0 1 u i ( 1 − u ) β ℵ T ( C T − 1 ( u ) ) d u = E U U i ( 1 − U ) β ℵ T ( C T − 1 ( U ) ) ,
for β = 1 or τ , completes the proof.    □
Example 4. 
Let T ∼ Exp ( λ ) with ℵ T ( t ) = λ e − λ t , C T ( t ) = 1 − e − λ t , C ¯ T ( t ) = e − λ t , and  C T − 1 ( u ) = − 1 λ ln ( 1 − u ) . Then,
ℵ T ( C T − 1 ( u ) ) = λ ( 1 − u ) .
Then,
ξ τ T [ r , n , m ˜ , k ] = 1 τ − 1 ∑ i = 0 1 1 i ( − ζ ) i ∫ 0 1 u i ( 1 − u ) λ ( 1 − u ) d u − ∑ i = 0 N ( τ ) N ( τ ) i ( − ζ ) i ∫ 0 1 u i ( 1 − u ) τ λ ( 1 − u ) d u = 1 λ ( τ − 1 ) ∑ i = 0 1 1 i ( − ζ ) i ∫ 0 1 u i d u − ∑ i = 0 N ( τ ) N ( τ ) i ( − ζ ) i ∫ 0 1 u i ( 1 − u ) τ − 1 d u = 1 λ ( τ − 1 ) 1 − ζ 2 − ∑ i = 0 N ( τ ) N ( τ ) i ( − ζ ) i B ( i + 1 , τ ) ,
where B ( a , b ) = ∫ 0 1 u a − 1 ( 1 − u ) b − 1 d u is the beta function.
Example 5. 
Let T ∼ Uniform ( 0 , θ ) with ℵ T ( t ) = 1 / θ , C T ( t ) = t / θ , C ¯ T ( t ) = 1 − t / θ , and  C T − 1 ( u ) = θ u . Then,
ℵ T ( C T − 1 ( u ) ) = 1 / θ .
Substituting
ξ τ T [ r , n , m ˜ , k ] = 1 τ − 1 ∑ i = 0 1 1 i ( − ζ ) i ∫ 0 1 θ u i ( 1 − u ) d u − ∑ i = 0 N ( τ ) N ( τ ) i ( − ζ ) i ∫ 0 1 θ u i ( 1 − u ) τ d u = θ τ − 1 1 2 − ζ 6 − ∑ i = 0 N ( τ ) N ( τ ) i ( − ζ ) i B ( i + 1 , τ + 1 ) .
Example 6. 
Let T follow a power distribution with C T ( t ) = ( t / α ) θ , 0 < t < α , θ > 0 . Then ℵ T ( t ) = θ α t α θ − 1 , C T − 1 ( u ) = α u 1 / θ , and
ℵ T ( C T − 1 ( u ) ) = θ α u 1 − 1 / θ .
Substituting
ξ τ T [ r , n , m ˜ , k ] = 1 τ − 1 [ ∑ i = 0 1 1 i ( − ζ ) i ∫ 0 1 α θ u i + 1 / θ − 1 ( 1 − u ) d u − ∑ i = 0 N ( τ ) N ( τ ) i ( − ζ ) i ∫ 0 1 α θ u i + 1 / θ − 1 ( 1 − u ) τ d u ] = α θ ( τ − 1 ) B 1 θ , 2 − ζ B 1 θ , 3 − ∑ i = 0 N ( τ ) N ( τ ) i ( − ζ ) i B 1 θ , τ + i + 1 .

3.2. CRTsE in CGdOSs from CM Family

Theorem 6. 
Let T [ r , n , m ˜ , k ] be the CGdOS from CM ( ζ 1 , ζ 2 ) and suppose I τ < ∞ . Then,
Ψ [ r , n , m ˜ , k ] = 1 τ − 1 1 − ∑ i = 0 N ( τ ) τ i ( − 1 ) i ( ζ ( m ˜ , k ) ( r , n ) ) i E U U i ( 1 − U ) τ ℵ T ( C T − 1 ( U ) ) .
where U is a uniform RV on ( 0 , 1 ) .
Proof. 
Based on (10) and (4), we then have
Ψ [ r , n , m ˜ , k ] ( t ) = 1 τ − 1 1 − ∫ 0 ∞ C ¯ [ r , n , m ˜ , k ] ( t ) τ d t d t = 1 τ − 1 1 − ∫ 0 ∞ C ¯ T ( t ) 1 − ζ ( m ˜ , k ) ( r , n ) C T ( t ) τ d t = 1 τ − 1 1 − ∑ i = 0 N ( τ ) ( − 1 ) i N ( τ ) i ζ ( m ˜ , k ) ( r , n ) i ∫ 0 ∞ ( C ¯ T ( t ) ) τ C T ( t ) i d t .
After taking C T ( t ) = u . Then we have
Ψ [ r , n , m ˜ , k ] ( t ) = 1 τ − 1 1 − ∑ i = 0 N ( τ ) N ( τ ) i ( − 1 ) i ζ ( m ˜ , k ) ( r , n ) i ∫ 0 1 U i 1 − U τ ℵ T ( ( C T − 1 ( U ) ) ) d u .
□
Proposition 3. 
Let T [ r , n , 0 , 1 ] be the CTOS and T [ n , − 1 , 1 ] be the ConRec from CM ( ζ 1 , ζ 2 ) family. Then,
Ψ [ r , n , 0 , 1 ] ( t ; ζ 1 , ζ 2 ) = Ψ [ n − r + 1 , n , 0 , 1 ] ( t ; ζ 1 , − ζ 2 ) ,
and
Ψ [ n , − 1 , 1 ] ( u ) ( t ; ζ 1 , ζ 2 ) = Ψ [ n , − 1 , 1 ] ( l ) ( t ; ζ 1 , − ζ 2 ) .
Example 7. 
According to CM-ED, we then have
Ψ [ r , n , m ˜ , k ] ( t ) = 1 τ − 1 1 − ∑ i = 0 N ( τ ) N ( τ ) i ( − 1 ) i ζ ( m ˜ , k ) ( r , n ) i θ 2 β i + 1 , τ .
Example 8. 
For the CM bivariate power distribution (CM-PD) with DF,
C S , T ( s , t ) = s α 1 θ 1 t α 2 θ 2 1 + ζ 1 1 − t α 2 θ 2 + ζ 2 1 − s α 1 θ 1 1 − t α 2 θ 2 , 0 < s < α 1 , 0 < t < α 2 .
By using (18), we get n the CRTsE of T [ r , n , m ˜ , k ] based on CM-PD family as follows:
Ψ [ r , n , m ˜ , k ] ( t ) = 1 τ − 1 1 − ∑ i = 0 N ( τ ) N ( τ ) i ( − 1 ) i ζ ( m ˜ , k ) ( r , n ) i α 2 θ 2 β i + 1 θ 2 , 1 + τ .
From Table 4, the values of CRTsE for CTOS exhibit several noticeable trends as follows:
  • For a fixed sample size n and rank r, as  ζ 2 increases from negative to positive values, the CRTsE values generally increase for small r (e.g., r = 1 ) and decrease for large r (e.g., r = n ).
  • For fixed n and ζ 2 , the CRTsE values increase with r when ζ 2 < 0 , and decrease with r when ζ 2 > 0 .
  • generally, Ψ [ r , n , 0 , 1 ] ( t ; ζ 1 , ζ 2 ) = Ψ [ n − r + 1 , n , 0 , 1 ] ( t ; ζ 1 , − ζ 2 ) .
Table 4. CRTsE in T [ r , n , 0 , 1 ] based on the CM ( ζ 1 , ζ 2 ) .

3.3. Nonparametric Estimation of CRTsE

We use empirical estimators to calculate the CRTsE for concomitant T [ r , n , m ˜ , k ] . Our next stop will be at the problem of calculating the CRTsE for CGdOS from the empirical CRTE. In practical applications, the joint DF of ( S , T ) is often unknown, necessitating the use of nonparametric methods for estimating CRTsE. A natural approach involves replacing the SF C T [ r , n , m ˜ , k ] ( t ) by its empirical counterpart. The empirical SF of the concomitants is defined as
C ^ T [ r , n , m ˜ , k ] ( t ) = 1 n ∑ i = 1 n I T [ r , n , m ˜ , k ] , i > t ,
where I { · } denotes the indicator function. Substituting C ^ T [ r , n , m ˜ , k ] ( t ) into the CRTsE formula yields the nonparametric estimator as follows:
Ψ ^ [ r , n , m ˜ , k ] ( t ) = 1 τ − 1 1 − ∫ 0 ∞ C ¯ ^ [ r , n , m ˜ , k ] ( t ) τ d t d t = 1 τ − 1 1 − ∫ 0 ∞ C ¯ ^ T ( t ) 1 − ζ ( m ˜ , k ) ( r , n ) C ^ T ( t ) τ d t = 1 τ − 1 1 − ∑ j = 1 n − 1 ∫ t j t j + 1 C ¯ ^ T ( t ) 1 − ζ ( m ˜ , k ) ( r , n ) C ^ T ( t ) τ d t = 1 τ − 1 1 − ∑ j = 1 n − 1 π j 1 − j n 1 − ζ ( m ˜ , k ) ( r , n ) j n τ .
In this context, for any DF C ( . ) , the notation C ^ ( . ) denotes the empirical DF corresponding to C ( . ) , while π j = t ( j + 1 ) − t ( j ) , for  j = 1 , 2 , … , n − 1 , represents the sample spacings derived from ordered random samples of t j . This estimator is computationally simple and does not require any parametric assumptions about the underlying distribution. It is particularly useful in reliability analysis, where ordered data often arise naturally.
Example 9. 
Define a random sample from the CM-ED as ( S i , T i ) , where i varies from 1 to n. The sample spacings, represented by π j , are regarded as independent RVs. Moreover, π j demonstrates the ED with a mean of 1 θ ( n − j ) , where j varies from 1 to n − 1. For further details, see [21,22]. The expected value and variance of the empirical CRTsE in X [ r ] ⋆ are provided by
E Ψ ^ [ r , n , m ˜ , k ] ( t ) = 1 τ − 1 1 − ∑ j = 1 n − 1 1 θ ( n − j ) 1 − j n 1 − ζ ( m ˜ , k ) ( r , n ) j n τ ,
V a r Ψ ^ [ r , n , m ˜ , k ] ( t ) = 1 ( τ − 1 ) 2 ∑ j = 1 n − 1 1 θ 2 ( n − j ) 2 1 − j n 1 − ζ ( m ˜ , k ) ( r , n ) j n 2 τ .
A distribution-free upper bound for the variance of the proposed nonparametric estimator can be derived without assuming exponential spacings. Since the empirical survival function satisfies 0 ≤ C ¯ ^ [ r , n , m ˜ , k ] ( t ) ≤ 1 for all t, and the function g ( u ) = u τ is Lipschitz on [ 0 , 1 ] with constant L τ = τ for τ ≥ 1 and Hölder continuous with exponent τ for 0 < τ < 1 , we obtain
Var Ψ ^ ≤ 1 ( τ − 1 ) 2 · C τ 4 n · ∫ 0 ∞ C ¯ [ r , n , m ˜ , k ] ( t ) τ − 1 d t 2 ,
where C τ = τ for τ ≥ 1 and C τ = ( 4 n ) 1 − τ for 0 < τ < 1 . Hence, Var ( Ψ ^ ) = O ( 1 / n ) as n → ∞ , confirming the asymptotic efficiency of the estimator.
Remark 3 (Asymptotic normality).
Under the regularity conditions of Theorem 4 and the assumption that f T is Lipschitz continuous, the empirical SF converges uniformly to the true SF. An application of the continuous mapping theorem and the Glivenko–Cantelli theorem shows that Ψ ^ [ r , n , m ˜ , k ] is a strongly consistent estimator of Ψ [ r , n , m ˜ , k ] , i.e., Ψ ^ [ r , n , m ˜ , k ] → a . s . Ψ [ r , n , m ˜ , k ] as n → ∞ . Furthermore, under the same regularity conditions, a delta-method argument yields asymptotic normality:
n Ψ ^ [ r , n , m ˜ , k ] − Ψ [ r , n , m ˜ , k ] → d N ( 0 , σ 2 ) .

3.4. Numerical Simulation Analysis

In this subsection, we run an extensive Monte Carlo simulation analysis to assess the finite-sample efficacy of the proposed nonparametric estimator Ψ ^ [ r , n , 0 , 1 ] ( t ) . The objective is to validate the theoretical insights derived in the preceding sections under various dependent structures. The simulation results are based on N = 10 , 000 independent Monte Carlo replications. For each replication, bivariate samples ( S i , T i ) were generated according to the Cambanis model. We consider a range of sample sizes n ∈ { 10 , 30 , 50 , 100 , 200 } and fix the default entropy order at τ = 2 . The dependence parameters ( ζ 1 , ζ 2 ) were chosen from the viable region Θ to ensure a legitimate distribution. We investigate the Mean Squared Error (MSE) of Ψ ^ [ r , n , 0 , 1 ] across three specific bivariate Cambanis specifications:
1.
CM-ED: Exponential marginals with θ 1 = θ 2 = 1 .
2.
CM-UD: Uniform marginals with θ 1 = θ 2 = 2 .
3.
CM-WD: Weibull marginals with θ 1 = θ 2 = 1 and shape parameters β 1 = β 2 = 1 .
In Table 5 we show the CM-ED empirical bias, variance and MSE as a function of ζ 1 = 0.1 , ζ 2 = 0.4 with median rank r = n / 2 . The variance of that estimator converges to 0 fast (as n gets larger), and the MSE (which combines variance and bias) converges to zero much slower. Table 6 compares the performance of the three models. Furthermore, Table 7 provides the mean absolute error (MAE) and compares the empirical mean and variance against their theoretical counterparts for the CM-ED model. Collectively, these results demonstrate that the estimator Ψ ^ [ r , n , 0 , 1 ] is asymptotically unbiased. The consistent reduction in MSE and variance across increasing sample sizes confirms the robustness and accuracy of the suggested framework for modeling complex systems with nonlinear dependencies.
Table 5. Bias, Variance, and MSE of Ψ ^ [ r , n , 0 , 1 ] under CM-ED ( θ 2 = 1 , τ = 2 , ζ 1 = 0.1 , ζ 2 = 0.4 , r = n / 2 ).
Table 6. MSE of Ψ ^ [ r , n , 0 , 1 ] across the three Cambanis models ( τ = 2 , ζ 1 = 0.1 , ζ 2 = 0.4 , r = n / 2 ).
Table 7. MAE of Ψ ^ [ r , n , 0 , 1 ] and empirical vs. theoretical mean and variance under CM-ED ( τ = 2 , θ 2 = 1 , ζ 1 = 0.1 , ζ 2 = 0.4 , r = n / 2 ).

4. Applications

This section illustrates the practical applicability of the proposed methodology through image segmentation application and the real data analysis in terms of reliability based on Tsallis entropy.

4.1. Image Processing

Image segmentation via histogram-based thresholding is one of the most practically important areas in which entropy measures have found direct application [23,24,25,26]. The core idea is to select a threshold intensity t * that partitions a grayscale image into foreground and background classes by optimizing a suitable information-theoretic criterion. While Shannon entropy has long been the default choice for this task, its well-known limitations for non-extensive, heavy-tailed, or multimodal histograms motivate the use of TsE as a more flexible alternative. Figure 3 displays the original image alongside its grayscale intensity histogram. The histogram exhibits a clear bimodal structure: a foreground peak near intensity 90 corresponding to the cameraman and tripod, and a broad background distribution centered near intensity 190 corresponding to the sky and ground. We compare the Tsallis-based threshold with the classical Shannon-based threshold across a range of the non-extensivity parameter τ , and evaluate segmentation quality through standard pixel-level metrics; see Figure 4. Let I be a grayscale image of size M × N pixels with intensity levels { 0 , 1 , … , L − 1 } , L = 256 . Denote by p i = h i / ( M N ) the normalized histogram, where h i is the count of pixels at intensity i. We now embed this setting within the concomitant framework of the paper. Associate with each pixel a pair ( S i , T i ) , i = 1 , … , n = M N , where T i is the observed intensity and S i is a latent spatial ranking variable, for instance, the gradient magnitude, local variance, or spatial coordinate, that determines the pixel’s rank ordering. Assume ( S i , T i ) are IID draws from a bivariate distribution within the CM ( ζ 1 , ζ 2 ) , so that the marginal distribution of T has CDF C T estimated by the empirical histogram C ^ T ( t ) = ∑ i = 0 t p i . When the spatial variables are ordered as S ( 1 ) ≤ S ( 2 ) ≤ ⋯ ≤ S ( n ) , the intensity associated with the r-th rank is the concomitant T [ r , n , 0 , 1 ] , whose PDF is given by Equation (8) of the paper:
ℵ [ r , n , 0 , 1 ] ( t ) = ℵ T ( t ) 1 + ζ ( 0 , 1 ) ( r , n ) 1 − 2 C T ( t ) ,
where the effective dependence parameter is (Remark 1, item 1)
ζ ( 0 , 1 ) ( r , n ) = ζ 1 + ζ 2 · n − 2 r + 1 n + 1 .
Equation (25) has an immediate interpretation in the image context: the rank r re-weights the marginal density ℵ T by the factor [ 1 + ζ ( 0 , 1 ) ( r , n ) ( 1 − 2 C T ( t ) ) ] . In the image context, this states that the TsE of the foreground-associated concomitant distribution equals the TsE of the complementary background-associated distribution when the sign of ζ 2 is flipped, which is a natural and desirable symmetry for a two-class partitioning criterion. For a threshold t ∈ { 1 , … , L − 1 } , define the two-class probability masses
P 0 ( t ) = ∑ i = 0 t − 1 p i , P 1 ( t ) = ∑ i = t L − 1 p i = 1 − P 0 ( t ) ,
and the class-conditional densities
q i ( 0 ) ( t ) = p i P 0 ( t ) , i < t ; q i ( 1 ) ( t ) = p i P 1 ( t ) , i ≥ t .
The per-class TsE of order τ ≠ 1 is
T s E ( c ) ( t ; τ ) = 1 τ − 1 1 − ∑ i ∈ C c q i ( c ) ( t ) τ , c ∈ { 0 , 1 } .
The non-extensive composition rule for two statistically dependentsubsystems is
Q t s ( t ) = T s E ( 0 ) ( t ; τ ) + T s E ( 1 ) ( t ; τ ) + ( 1 − τ ) T s E ( 0 ) ( t ; τ ) · T s E ( 1 ) ( t ; τ ) .
The third term in (29) is the non-extensive interaction term. It vanishes as τ → 1 (recovering the Shannon additive criterion) and becomes increasingly influential for τ far from unity. This term directly encodes the dependence between the two image classes in the same sense that the Cambanis family’s interaction term ζ 2 F S ( s ) F T ( t ) in Equation (1) of the paper encodes statistical dependence between S and T. The optimal threshold is
t τ * = arg max t ∈ { 1 , … , L − 1 } Q t s ( t ) .
As τ → 1 , the criterion (29) converges to the two-class Shannon entropy H ( 0 ) ( t ) + H ( 1 ) ( t ) = − ∑ c ∑ i ∈ C c q i ( c ) log q i ( c ) , and t τ * → t Shannon * . We employ the following four metrics, which together assess complementary aspects of segmentation quality:
Definition 1 (Segmentation quality metrics).
Let B ^ be the predicted foreground mask and B ref the reference mask. Define TP = | B ^ ∩ B ref | , FP = | B ^ ∖ B ref | , FN = | B ref ∖ B ^ | , TN = | B ^ ¯ ∩ B ref ¯ | .
1. 
Jaccard Index (IoU):  J = TP / ( TP + FP + FN ) . Ranges in [ 0 , 1 ] ; higher is better.
2. 
Dice Coefficient (F1):  D = 2 TP / ( 2 TP + FP + FN ) . Ranges in [ 0 , 1 ] ; higher is better. Note, D = 2 J / ( 1 + J ) .
3. 
Misclassification Error (MCE):  MCE = ( FP + FN ) / ( M N ) . Ranges in [ 0 , 1 ] ; lower is better.
4. 
Normalized Between-Class Variance ( σ ^ B 2 ):  σ ^ B 2 ( t ) = P 0 ( t ) P 1 ( t ) [ μ 0 ( t ) − μ 1 ( t ) ] 2 / σ T 2 , where μ c ( t ) is the class-conditional mean intensity and σ T 2 is the total intensity variance. Ranges in [ 0 , 1 ] ; higher indicates better between-class separation.
We apply the framework to the cameraman benchmark image ( 512 × 512 pixels, 8-bit grayscale). As shown in Figure 3, the normalized histogram exhibits a clear bimodal structure: a foreground peak near intensity μ 0 ≈ 90 (cameraman and tripod) and a broad background distribution centered near μ 1 ≈ 190 (sky and ground). The intensity valley between the two modes lies near t v ≈ 140 , establishing the range within which all optimal thresholds are expected to fall. Table 8 displays the optimal threshold t τ * increasing monotonically with τ , and the Dice coefficient and Jaccard index peak at τ = 2.0 – 3.0 , indicating that intermediate values of the non-extensivity parameter best capture the bimodal separation for this image. The Shannon threshold at t * = 141 produces the highest MCE and lowest Jaccard index among all methods, confirming quantitatively that its additive formulation is less well-suited to the heavy-tailed background distribution of the cameraman image. Figure 4 illustrates the application of TsE and Shannon entropy for image thresholding using the cameraman benchmark image. The Figure 4 highlights the effectiveness of TsE as a generalized framework for image thresholding, offering improved segmentation performance over the classical Shannon-entropy approach. Table 9 reports t τ * at τ = 2 for a range of Cambanis parameter values. As  ζ 2 increases (stronger positive spatial dependence), the optimal threshold shifts upward. This dependence of t τ * on ζ 2 demonstrates that the Tsallis thresholding criterion is genuinely dependence-aware: it responds to the spatial correlation structure of the image in a manner that classical Shannon-based methods, which assume independence, cannot replicate.
Table 8. Comparison of thresholding methods on the cameraman image. J: Jaccard index; D: Dice coefficient; MCE: misclassification error; and σ ^ B 2 : normalized between-class variance. Best value in each column is bold.
Table 9. Sensitivity of t τ = 2 * to the Cambanis dependence parameters for the cameraman image. Values shown for ζ 1 = 0.1 fixed.
Remark 4. 
All computations and Figures in this section, including the normalized histogram, the Tsallis criterion Q t s ( t ) , the optimal thresholds t τ * , the segmentation measures, and all displayed images were produced entirely in Python 3.11 using scikit-image.
Figure 3. (a) The cameraman benchmark image and (b) The normalized grayscale intensity histogram.
Figure 4. TsE vs. Shannon-entropy thresholding applied to the cameraman image. (a) Original grayscale image. (b) Intensity histogram with optimal threshold lines: Shannon (dashed black, t * = 141 ) and Tsallis for τ ∈ { 1.5 , 2 , 3 , 4 , 5 } (colored solid lines). (c) Binary segmentation at Tsallis τ = 1.5 ( t * = 144 ). (d) Binary segmentation at Tsallis τ = 3.0 ( t * = 151 ). (e) Binary segmentation at Shannon ( t * = 141 ).

4.2. Real Data Analysis

Data collection and analysis is as detailed in [27]. Simulated fundamental computer systems contain processors and memory n = 50 . A well-functioning computer consists of both components. Let us say that the system is on the verge of shutting down and would have been prior to October 2025. It happens quickly over a short timescale. Within a short time period (measured in hours), the decline moves quickly. Due to the greater susceptibility of systems to shocks (c.f. [28,29]), a fatal shock may incapacitate the primary component or, unpredictably, affect either this or the secondary component. The presumption of independence is false on the grounds that both components can be killed at once by a lethal shock. Hence, we carried out the conversation around this problem using CM copula. Table 10 shows the bivariate data set. Utilizing the dataset provided, we used two distinct bivariate models from the Cambanis family. Specifically, we focused on the CM-ED model with both marginals following exponential distributions and the Cambanis–Rayleigh (CM-RD) model with marginals that follow Rayleigh distributions. Parameter estimates for the maximum likelihood (MLE) and goodness-of-fit of each model were assessed using model selection criteria, including Akaike Information Criterion (AIC), corrected AIC (AICc), Bayesian Information Criterion (BIC), Hannan–Quinn Information Criterion (HQIC), and Consistent AIC (CAIC). The dual modeling approach gives rise to comparable multiple marginal specifications within Cambanis dependence structure. The DFs of CM-ED and CM-RD are, respectively, given by
C S , T ( s , t ; ζ ̲ ) = ( 1 − exp ( − s θ 1 ) ) ( 1 − exp ( − t θ 2 ) ) 1 + ζ 1 exp ( − t θ 2 ) + ζ 2 exp ( − s θ 1 ) exp ( − t θ 2 ) , s , t , θ 1 , θ 2 > 0 ,
and
C S , T ( s , t ; ζ ̲ ) = 1 − e − s 2 / ( 2 σ 1 2 ) 1 − e − t 2 / ( 2 σ 2 2 ) 1 + ζ 1 e − t 2 / ( 2 σ 2 2 ) + ζ 2 e − s 2 / ( 2 σ 1 2 ) e − t 2 / ( 2 σ 2 2 ) .
Table 11 presents the parameter estimates by using MLE and model selection criteria for the two fitted Cambanis models. Based on these criteria, the CM-ED bivariate model exhibits lower values of AIC, AICc, BIC, HQIC, and CAIC, indicating a superior fit to the data. Figure 5 and Figure 6 display the visualization of the two bivariate models fitted to the dataset. The scatter plot illustrates the observed data points in the two-dimensional space, providing insights into the underlying dependency structure between the variables. The 3D density surface depicts the JPDF, clearly showing the concentration of probability mass around the central region of the data and the tail behavior in the joint distribution. The contour plot complements the 3D view by projecting the density levels onto the two-dimensional plane, allowing a detailed examination of the density concentration and the spread of the fitted model. These graphical representations demonstrate the ability of this model to capture both the marginal behaviors and the dependence structure present in the dataset. Figure 7 illustrates the T s E [ r , n , 0 , 1 ] for CTOS computed from a real dataset, using two CM models. The TsE curve for CM-ED increases monotonically with r, starting from a lower value at r = 1 and approaching a plateau for larger r. The TsE curve for CM-RD remains nearly constant across r. Initially, TsE under CM-ED is lower than CM-RD but, as r increases, the CM-ED curve gradually approaches and slightly exceeds the CM-RD. The increasing trend in CM-ED suggests that uncertainty grows with higher-ranked order statistics but stabilizes for large r.
Table 10. Computer series system of two components.
Table 11. Parameter estimates and model selection criteria for the fitted Cambanis models.
Figure 5. Scatter plot, 3D density, and contour plot for CM-ED model fitted to the dataset.
Figure 6. Scatter plot, 3D density, and contour plot for CM-RD model fitted to the dataset.
Figure 7. T s E in CTOSs from real data set.

4.3. Multi-Component Reliability Systems

The two-component computer series system considered previously was selected as a simple illustrative example. To demonstrate that the proposed CRTsE framework is not restricted to elementary configurations, we extend the formulation to systems with m ≥ 2 dependent components. Let ( T 1 , T 2 , … , T m ) denote component lifetimes following the multivariate extension of the CM model under identical marginal SFs F ¯ T ( t ) = P ( T > t ) . For a series system, failure occurs when the first component fails, and, therefore, the system lifetime is T series = min ( T 1 , … , T m ) . The corresponding system SF is
F ¯ series ( t ) = P ( T 1 > t , … , T m > t ) .
Under identical marginals and exchangeable dependence, this quantity is obtained directly from the associated multivariate survival representation. Substituting F ¯ series ( t ) into the proposed CRTsE measure gives
Ψ τ ( series ) = 1 τ − 1 1 − ∫ 0 ∞ F ¯ series ( t ) τ d t .
For a parallel system, the lifetime is
T parallel = max ( T 1 , … , T m ) ,
with SF
F ¯ parallel ( t ) = 1 − P ( T 1 ≤ t , … , T m ≤ t ) .
The corresponding CRTsE
Ψ τ ( parallel ) = 1 τ − 1 1 − ∫ 0 ∞ F ¯ parallel ( t ) τ d t .
The formulation above shows that the proposed framework extends naturally from the original two-component example to systems with arbitrary numbers of dependent components. Consequently, the two-component computer series system considered in Section 4.2 represents a particular case corresponding to m = 2 . Under the exchangeable m-variate FGM-Cambanis copula with identical margins, the joint survival function for the series system takes the closed form
F ¯ series ( t ) = F T ( t ) m 1 + ζ 2 m 2 F ¯ T ( t ) 2 ,
where F T ( t ) = 1 − F ¯ T ( t ) is the common CDF, and ζ 2 is the pairwise dependence parameter from the Cambanis family (with ζ 1 = 0 for exchangeability). Substituting (33) into (31) yields an explicit integral that can be evaluated numerically for any m ≥ 2 .

5. Conclusions and Future Work

This paper developed a rigorous and comprehensive framework for analyzing TsE and CRTsE within the setting of concomitants of CGdOSs under the Cambanis family of bivariate distributions. The main theoretical contributions are as follows. First, explicit closed-form expressions for TsE, CRTsE, and the alternative CRTsE were derived, along with quantile-based and binomial-series representations that facilitate both analytical study and numerical computation. Second, structural properties, including symmetry relations between low- and high-rank concomitants for both CTOSs and record values, were rigorously proved. Third, the convergence of the binomial expansion at boundary points was established, and the conditions justifying the interchange of summation and integration were explicitly verified via the dominated convergence theorem. Fourth, a nonparametric estimator for CRTsE was proposed; its mean, variance, strong consistency, and asymptotic normality were established analytically, and its finite-sample behavior was confirmed through Monte Carlo simulation. Fifth, the framework was applied to image segmentation via a rank-sensitive Tsallis-thresholding scheme and to real-data reliability modeling. A key finding is that the Tsallis-based measures are superior to classical Shannon-based approaches for systems with nonlinear dependence and tail sensitivity. The non-additivity parameter τ provides fine-grained control over sensitivity to rare events, a feature absent in Shannon entropy.
Future work will explore (i) generalization to multivariate settings with more than two components, (ii) other generalized entropy measures based on more complex set functions, (iii) dynamic versions of CRTsE for degradation modeling, and (iv) advanced high-dimensional estimation strategies.

Author Contributions

Conceptualization, M.N. and I.A.H.; methodology, M.N.Q.; software, I.A.H.; validation, M.N., M.N.Q. and I.A.H.; formal analysis, M.N.; investigation, I.A.H.; resources, M.N.Q.; data curation, M.N.; writing—original draft preparation, I.A.H.; writing—review and editing, M.N.; visualization, M.N.Q.; supervision, I.A.H.; project administration, M.N.; funding acquisition, M.N. All authors have read and agreed to the published version of the manuscript.

Funding

Ongoing Research Funding Program, (ORF-2026-969), King Saud University, Riyadh, Saudi Arabia.

Data Availability Statement

The original contributions presented in this study are included in the article.

Acknowledgments

The authors extend their appreciation to King Saud University for funding this work under a project titled Ongoing Research Funding Program funded by the King Saud University, Riyadh, Saudi Arabia under the grant number (ORF-2026-969).

Conflicts of Interest

The authors declare no competing interests.

References

  1. Farlie, D.J. The performance of some correlation coefficients for a general bivariate distribution. Biometrika 1960, 47, 307–323. [Google Scholar] [CrossRef] [Scilit]
  2. Gumbel, E.J. Bivariate exponential distributions. J. Am. Stat. Assoc. 1960, 55, 698–707. [Google Scholar] [CrossRef] [Scilit]
  3. Morgenstern, D. Einfache Beispiele zweidimensionaler Verteilungen. Mitt. Math. Stat. 1956, 8, 234–235. [Google Scholar]
  4. Cambanis, S. Some properties and generalizations of multivariate Eyraud–Gumbel–Morgenstern distributions. J. Multivar. Anal. 1977, 7, 551–559. [Google Scholar]
  5. Cambanis, S.; Huang, S.; Simons, G. On the theory of elliptically contoured distributions. J. Multivar. Anal. 1981, 11, 368–385. [Google Scholar] [CrossRef] [Scilit]
  6. Husseiny, I.; Alawady, M.; Barakat, H.; Abd Elgawad, M. Information measures for order statistics and their concomitants from Cambanis bivariate family. Commun. Stat.-Theory Methods 2024, 53, 865–881. [Google Scholar]
  7. Abd Elgawad, M.A.; Barakat, H.M.; Alawady, M.A. Concomitants of generalized order statistics from bivariate Cambanis family: Some information measures. Bull. Iran. Math. Soc. 2022, 48, 563–585. [Google Scholar]
  8. Alawady, M.; Barakat, H.; Abd Elgawad, M. Concomitants of generalized order statistics from bivariate Cambanis family of distributions under a general setting. Bull. Malays. Math. Sci. Soc. 2021, 44, 3129–3159. [Google Scholar] [CrossRef] [Scilit]
  9. Koshti, R.D.; Kamalja, K.K. Parameter estimation of Cambanis-type bivariate uniform distribution with ranked set sampling. J. Appl. Stat. 2021, 48, 61–83. [Google Scholar] [PubMed]
  10. Nair, N.U.; Scaria, J.; Mohan, S. The Cambanis family of bivariate distributions: Properties and applications. Statistica 2016, 76, 169–184. [Google Scholar]
  11. 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. [Google Scholar] [CrossRef] [Scilit]
  12. Tsallis, C. Possible generalization of Boltzmann–Gibbs statistics. J. Stat. Phys. 1988, 52, 479–487. [Google Scholar]
  13. Sati, M.M.; Gupta, N. Some characterization results on dynamic cumulative residual Tsallis entropy. J. Probab. Stat. 2015, 2015, 694203. [Google Scholar] [CrossRef] [Scilit]
  14. Husseiny, I.; Nagy, M.; Mansi, A.; Alawady, M. Some Tsallis entropy measures in concomitants of generalized order statistics under iterated FGM bivariate distribution. AIMS Math. 2024, 9, 23268–23290. [Google Scholar] [CrossRef] [Scilit]
  15. Rajesh, G.; Sunoj, S. Some properties of cumulative Tsallis entropy of order α. Stat. Pap. 2019, 60, 933–943. [Google Scholar]
  16. Kamps, U. A concept of generalized order statistics. J. Stat. Plan. Inference 1995, 48, 1–23. [Google Scholar] [CrossRef] [Scilit]
  17. Kamps, U.; Cramer, E. On distributions of generalized order statistics. Statistics 2001, 35, 269–280. [Google Scholar] [CrossRef] [Scilit]
  18. Yang, S.-S. General distribution theory of the concomitants of order statistics. Ann. Stat. 1977, 5, 996–1002. [Google Scholar] [CrossRef] [Scilit]
  19. Barakat, H.; Husseiny, I. Some information measures in concomitants of generalized order statistics under iterated Farlie–Gumbel–Morgenstern bivariate type. Quaest. Math. 2021, 44, 581–598. [Google Scholar]
  20. Beg, M.; Ahsanullah, M. Concomitants of generalized order statistics from Farlie–Gumbel–Morgenstern distributions. Stat. Methodol. 2008, 5, 1–20. [Google Scholar]
  21. Chandler, K. The distribution and frequency of record values. J. R. Stat. Soc. Ser. B 1952, 14, 220–228. [Google Scholar] [CrossRef] [Scilit]
  22. Pyke, R. Spacings. J. R. Stat. Soc. Ser. B 1965, 27, 395–436. [Google Scholar] [CrossRef] [Scilit]
  23. De Albuquerque, M.P.; Esquef, I.A.; Mello, A.G. Image thresholding using Tsallis entropy. Pattern Recognit. Lett. 2004, 25, 1059–1065. [Google Scholar] [CrossRef] [Scilit]
  24. Wang, S.; Fan, J. Image thresholding method based on Tsallis entropy correlation. Multimed. Tools Appl. 2025, 84, 9749–9785. [Google Scholar]
  25. Otsu, N. A threshold selection method from gray-level histograms. Automatica 1979, 11, 285–296. [Google Scholar]
  26. Kapur, J.N.; Sahoo, P.K.; Wong, A.K. A new method for gray-level picture thresholding using the entropy of the histogram. Comput. Vis. Graph. Image Process. 1985, 29, 273–285. [Google Scholar] [CrossRef] [Scilit]
  27. Oliveira, R.P.; Achcar, J.A.; Mazucheli, J.; Bertoli, W. A new class of bivariate Lindley distributions based on stress and shock models and some of their reliability properties. Reliab. Eng. Syst. Saf. 2021, 211, 107528. [Google Scholar] [CrossRef] [Scilit]
  28. Haj Ahmad, H.; Almetwally, E.M.; Ramadan, D.A. Investigating the relationship between processor and memory reliability in data science: A bivariate model approach. Mathematics 2023, 11, 2142. [Google Scholar] [CrossRef] [Scilit]
  29. Barakat, H.; Alawady, M.; Husseiny, I.; Nagy, M.; Mansi, A.; Mohamed, M. Bivariate Epanechnikov–exponential distribution: Statistical properties, reliability measures, and applications to computer science data. AIMS Math. 2024, 9, 32299–32327. [Google Scholar]
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.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.