Failure extropy, introduced by Nair and Sathar Nair [(2020). On dynamic failure extropy. J. Indian Soc. Probab. Stat. 21: 287–-313], provides a complementary perspective to entropy for quantifying uncertainty in lifetime distributions. However, it becomes mathematically invalid for distributions with unbounded support. To overcome this limitation, Tahmasebi and Toomaj [(2022). On negative cumulative extropy with applications. Commun. Stat. Theory Methods 51(15): 5025-–5047] proposed the concept of negative cumulative extropy (NCEx), offering a bounded and interpretable alternative. In this paper, we extend the notion of NCEx to the bivariate dynamic setting, where uncertainty is assessed for systems whose components have failed at specified times. The proposed formulation effectively captures the uncertainty associated with past lifetimes under dependence, which the existing NCEx cannot address. The measure is further generalized to a vector-valued form, and its fundamental properties are established, including monotonicity, invariance, bounds expressed in terms of the expected inactivity time, and key characterizations. A new stochastic ordering based on the proposed measure is also established. To facilitate practical implementation, a nonparametric estimator is developed and its performance evaluated through extensive Monte Carlo simulations. The practical relevance of the proposed measure is demonstrated using a real dataset, and its superiority over existing entropy-based approaches is shown on an additional dataset.

Measure of uncertainty in past lifetime distribution plays an important role in the context of information theory, forensic science and other related fields. In the present work, we propose non-parametric kernel type estimator for generalized past entropy function, which was introduced by Gupta and Nanda [9], under $\alpha$-mixing sample. The resulting estimator is shown to be weak and strong consistent and asymptotically normally distributed under certain regularity conditions. The performance of the estimator is validated through simulation study and a real data set.

The Kerridge [(1961). Inaccuracy and inference. Journal of the Royal Statistical Society: Series B 23(1): 184-194] inaccuracy measure is the mathematical expectation of the information content of the true distribution with respect to an assumed distribution, reflecting the inaccuracy introduced when the assumed distribution is used. Analyzing the dispersion of information around such measures helps us understand their consistency. The study of dispersion of information around the inaccuracy measure is termed varinaccuracy. Recently, Balakrishnan et al. [(2024). Dispersion indices based on Kerridge inaccuracy measure and Kullback–Leibler divergence. Communications in Statistics – Theory and Methods 53(15): 5574-5592] introduced varinaccuracy, to compare models where lower variance indicates greater precision. As interval inaccuracy is crucial for analyzing the evolution of system reliability over time, examining its variability strengthens the validity of the extracted information. This article introduces the varinaccuracy measure for doubly truncated random variables and demonstrates its significance. The measure has been studied under transformations, and bounds are also provided to broaden the applicability of the measure where direct evaluation is challenging. Additionally, an estimator for the measure is proposed, and its consistency is analyzed using simulated data through a kernel-smoothed nonparametric estimation technique. The estimator is validated on real data sets of COVID-19 mortality rates for Mexico and Italy. Furthermore, the article illustrates the practical value of the measure in selecting the best alternative to a given distribution within an interval, following the minimum information discrimination principle, thereby highlighting the effectiveness of the study.

In a recent paper, the authors studied the distribution properties of a class of exchangeable processes, called measure-valued Pólya sequences (MVPSs), which arise as the observation process in a generalized urn sampling scheme. Here we present several results in the form of ‘sufficientness’ postulates that characterize their predictive distributions. In particular, we show that exchangeable MVPSs are the unique exchangeable models whose predictive distributions are a mixture of the marginal distribution and the average of a probability kernel evaluated at past observations. When the latter coincides with the empirical measure, we recover a well-known result for the exchangeable model with a Dirichlet process prior. In addition, we provide a ‘pure’ sufficientness postulate for exchangeable MVPSs that does not assume a particular analytic form for the predictive distributions. Two other sufficientness postulates consider the case when the state space is finite.

We propose Rényi information generating function (RIGF) and discuss its properties. A connection between the RIGF and the diversity index is proposed for discrete-type random variables. The relation between the RIGF and Shannon entropy of order q > 0 is established and several bounds are obtained. The RIGF of escort distribution is derived. Furthermore, we introduce the Rényi divergence information generating function (RDIGF) and discuss its effect under monotone transformations. We present nonparametric and parametric estimators of the RIGF. A simulation study is carried out and a real data relating to the failure times of electronic components is analyzed. A comparison study between the nonparametric and parametric estimators is made in terms of the standard deviation, absolute bias, and mean square error. We have observed superior performance for the newly proposed estimators. Some applications of the proposed RIGF and RDIGF are provided. For three coherent systems, we calculate the values of the RIGF and other well-established uncertainty measures, and similar behavior of the RIGF is observed. Further, a study regarding the usefulness of the RDIGF and RIGF as model selection criteria is conducted. Finally, three chaotic maps are considered and then used to establish a validation of the proposed information generating function.

We study the problem of identifying a small number $k\sim n^\theta$, $0\lt \theta \lt 1$, of infected individuals within a large population of size $n$ by testing groups of individuals simultaneously. All tests are conducted concurrently. The goal is to minimise the total number of tests required. In this paper, we make the (realistic) assumption that tests are noisy, that is, that a group that contains an infected individual may return a negative test result or one that does not contain an infected individual may return a positive test result with a certain probability. The noise need not be symmetric. We develop an algorithm called SPARC that correctly identifies the set of infected individuals up to $o(k)$ errors with high probability with the asymptotically minimum number of tests. Additionally, we develop an algorithm called SPEX that exactly identifies the set of infected individuals w.h.p. with a number of tests that match the information-theoretic lower bound for the constant column design, a powerful and well-studied test design.

Questions of ‘how best to acquire data’ are essential to modelling and prediction in the natural and social sciences, engineering applications, and beyond. Optimal experimental design (OED) formalizes these questions and creates computational methods to answer them. This article presents a systematic survey of modern OED, from its foundations in classical design theory to current research involving OED for complex models. We begin by reviewing criteria used to formulate an OED problem and thus to encode the goal of performing an experiment. We emphasize the flexibility of the Bayesian and decision-theoretic approach, which encompasses information-based criteria that are well-suited to nonlinear and non-Gaussian statistical models. We then discuss methods for estimating or bounding the values of these design criteria; this endeavour can be quite challenging due to strong nonlinearities, high parameter dimension, large per-sample costs, or settings where the model is implicit. A complementary set of computational issues involves optimization methods used to find a design; we discuss such methods in the discrete (combinatorial) setting of observation selection and in settings where an exact design can be continuously parametrized. Finally we present emerging methods for sequential OED that build non-myopic design policies, rather than explicit designs; these methods naturally adapt to the outcomes of past experiments in proposing new experiments, while seeking coordination among all experiments to be performed. Throughout, we highlight important open questions and challenges.

Measures of uncertainty are a topic of considerable and growing interest. Recently, the introduction of extropy as a measure of uncertainty, dual to Shannon entropy, has opened up interest in new aspects of the subject. Since there are many versions of entropy, a unified formulation has been introduced to work with all of them in an easy way. Here we consider the possibility of defining a unified formulation for extropy by introducing a measure depending on two parameters. For particular choices of parameters, this measure provides the well-known formulations of extropy. Moreover, the unified formulation of extropy is also analyzed in the context of the Dempster–Shafer theory of evidence, and an application to classification problems is given.

We show how convergence to the Gumbel distribution in an extreme value setting can be understood in an information-theoretic sense. We introduce a new type of score function which behaves well under the maximum operation, and which implies simple expressions for entropy and relative entropy. We show that, assuming certain properties of the von Mises representation, convergence to the Gumbel distribution can be proved in the strong sense of relative entropy.

The principle of maximum entropy is a well-known approach to produce a model for data-generating distributions. In this approach, if partial knowledge about the distribution is available in terms of a set of information constraints, then the model that maximizes entropy under these constraints is used for the inference. In this paper, we propose a new three-parameter lifetime distribution using the maximum entropy principle under the constraints on the mean and a general index. We then present some statistical properties of the new distribution, including hazard rate function, quantile function, moments, characterization, and stochastic ordering. We use the maximum likelihood estimation technique to estimate the model parameters. A Monte Carlo study is carried out to evaluate the performance of the estimation method. In order to illustrate the usefulness of the proposed model, we fit the model to three real data sets and compare its relative performance with respect to the beta generalized Weibull family.

Recently, there is a growing interest to study the variability of uncertainty measure in information theory. For the sake of analyzing such interest, varentropy has been introduced and examined for one-sided truncated random variables. As the interval entropy measure is instrumental in summarizing various system and its components properties when it fails between two time points, exploring variability of such measure pronounces the extracted information. In this article, we introduce the concept of varentropy for doubly truncated random variable. A detailed study of theoretical results taking into account transformations, monotonicity and other conditions is proposed. A simulation study has been carried out to investigate the behavior of varentropy in shrinking interval for simulated and real-life data sets. Furthermore, applications related to the choice of most acceptable system and the first-passage times of an Ornstein–Uhlenbeck jump-diffusion process are illustrated.

This paper concentrates on the fundamental concepts of entropy, information and divergence to the case where the distribution function and the respective survival function play the central role in their definition. The main aim is to provide an overview of these three categories of measures of information and their cumulative and survival counterparts. It also aims to introduce and discuss Csiszár's type cumulative and survival divergences and the analogous Fisher's type information on the basis of cumulative and survival functions.

This paper studies estimation of stochastic block models with Rissanen’s minimum description length (MDL) principle in the dense graph asymptotics. We focus on the problem of model specification, i.e., identification of the number of blocks. Refinements of the true partition always decrease the code part corresponding to the edge placement, and thus a respective increase of the code part specifying the model should overweight that gain in order to yield a minimum at the true partition. The balance between these effects turns out to be delicate. We show that the MDL principle identifies the true partition among models whose relative block sizes are bounded away from zero. The results are extended to models with Poisson-distributed edge weights.

The geometric structure of the nonparametric statistical model of all positive densities connected by an open exponential arc and its intimate relation to Orlicz spaces give new insights to well-known financial objects which arise in exponential utility maximization problems.

The proportional hazards (PH) model and its associated distributions provide suitable media for exploring connections between the Gini coefficient, Fisher information, and Shannon entropy. The connecting threads are Bayes risks of the mean excess of a random variable with the PH distribution and Bayes risks of the Fisher information of the equilibrium distribution of the PH model. Under various priors, these Bayes risks are generalized entropy functionals of the survival functions of the baseline and PH models and the expected asymptotic age of the renewal process with the PH renewal time distribution. Bounds for a Bayes risk of the mean excess and the Gini's coefficient are given. The Shannon entropy integral of the equilibrium distribution of the PH model is represented in derivative forms. Several examples illustrate implementation of the results and provide insights for potential applications.

We provide some results for the comparison of the failure times and interfailure times of two systems based on a replacement policy proposed by Kapodistria and Psarrakos (2012). In particular, we show that when the first failure times are ordered in terms of the dispersive order (or, the excess wealth order), then the successive interfailure times are ordered in terms of the usual stochastic order (respectively, the increasing convex order). As a consequence, we provide comparison results for the cumulative residual entropies of the systems and their dynamic versions.

Given two absolutely continuous nonnegative independent random variables, we define the reversed relevation transform as dual to the relevation transform. We first apply such transforms to the lifetimes of the components of parallel and series systems under suitably proportionality assumptions on the hazard rates. Furthermore, we prove that the (reversed) relevation transform is commutative if and only if the proportional (reversed) hazard rate model holds. By repeated application of the reversed relevation transform we construct a decreasing sequence of random variables which leads to new weighted probability densities. We obtain various relations involving ageing notions and stochastic orders. We also exploit the connection of such a sequence to the cumulative entropy and to an operator that is dual to the Dickson-Hipp operator. Iterative formulae for computing the mean and the cumulative entropy of the random variables of the sequence are finally investigated.

Classical results for exchangeable systems of random variables are extended to multiclass systems satisfying a natural partial exchangeability assumption. It is proved that the conditional law of a finite multiclass system, given the value of the vector of the empirical measures of its classes, corresponds to independent uniform orderings of the samples within {each} class, and that a family of such systems converges in law {if and only if} the corresponding empirical measure vectors converge in law. As a corollary, convergence within {each} class to an infinite independent and identically distributed system implies asymptotic independence between {different} classes. A result implying the Hewitt-Savage 0-1 law is also extended.

The simulation of distributions of financial assets is an important issue for financial institutions. If risk measures are evaluated for a simulated distribution instead of the model-implied distribution, the errors in the risk measurements need to be analyzed. For distribution-invariant risk measures which are continuous on compacts, we employ the theory of large deviations to study the probability of large errors. If the approximate risk measurements are based on the empirical distribution of independent samples, then the rate function equals the minimal relative entropy under a risk measure constraint. We solve this minimization problem explicitly for shortfall risk and average value at risk.

Burn-in is a widely used engineering procedure useful for eliminating ‘weak’ items and consequently improving the quality of remaining items. The quality of items can be measured via various performance characteristics. In the present paper we develop new performance criteria for the burn-in method. Our criteria not only take into account the reliability of an item, they also incorporate covariates.