Related papers: On General Weighted Extropy of Ranked Set Sampling
The paper that is commented by Touchette contains a computational study which opens the door to a desirable generalization of the standard large deviation theory (applicable to a set of $N$ nearly independent random variables) to systems…
Recently, there has been growing attention to study uncertainty measures for doubly truncated random variables. In this paper, the concept of varextropy for doubly truncated random variables is introduced. The changes of this measure under…
Linear combinations of independent random variables have been extensively studied in the literature. However, most of the work is based on some specific distribution assumptions. In this paper, a companion of (J. Appl. Probab. 48 (2011)…
We study a generalization of deduplication, which enables lossless deduplication of highly similar data and show that standard deduplication with fixed chunk length is a special case. We provide bounds on the expected length of coded…
We study the statistical properties of the sampled scale-free networks, deeply related to the proper identification of various real-world networks. We exploit three methods of sampling and investigate the topological properties such as…
We consider the Bayesian estimation of the parameters of a finite mixture model from independent order statistics arising from imperfect ranked set sampling designs. As a cost-effective method, ranked set sampling enables us to incorporate…
As learning difficulty is crucial for machine learning (e.g., difficulty-based weighting learning strategies), previous literature has proposed a number of learning difficulty measures. However, no comprehensive investigation for learning…
We consider independently identically distributed random compositions of the Gauss and R\'enyi maps that generate random continued fractions. Using methods of ergodic theory, thermodynamic formalism and large deviations, we show that…
Biased sampling designs can be highly efficient when studying rare (binary) or low variability (continuous) endpoints. We consider longitudinal data settings in which the probability of being sampled depends on a repeatedly measured…
The generalized word length pattern of an orthogonal array allows a ranking of orthogonal arrays in terms of the generalized minimum aberration criterion (Xu and Wu [Ann. Statist. 29 (2001) 1066-1077]). We provide a statistical…
We derive a composite centrality measure for general weighted and directed complex networks, based on measure standardisation and invariant statistical inheritance schemes. Different schemes generate different intermediate abstract measures…
The goal of diversity sampling is to select a representative subset of data in a way that maximizes information contained in the subset while keeping its cardinality small. We introduce the ordered diverse sampling problem based on a new…
This paper investigates the weighted-averaging dynamic for unconstrained and constrained consensus problems. Through the use of a suitably defined adjoint dynamic, quadratic Lyapunov comparison functions are constructed to analyze the…
We present a new class of estimators of Shannon entropy for severely undersampled discrete distributions. It is based on a generalization of an estimator proposed by T. Schuermann, which itself is a generalization of an estimator proposed…
Rank weights and generalized rank weights have been proven to characterize error and erasure correction, and information leakage in linear network coding, in the same way as Hamming weights and generalized Hamming weights describe classical…
The notion of expansivity and its generalizations (measure expansive, measure positively expansive, continuum-wise expansive, countably-expansive) are well known for deterministic systems and can be a useful property for studying…
In this work we develop a geometric approach to the study of rank metric codes. Using this method, we introduce a simpler definition for generalized rank weight of linear codes. We give a complete classification of constant rank weight code…
We present an entropy comparison result concerning weighted sums of independent and identically distributed random variables.
Measure of the weighted cumulative entropy about the predictability of failure time of a system have been introduced in [3]. Referring properties of doubly truncated (interval) cumulative residual and past entropy, several bounds and…
We consider linear codes over some fixed finite field extension over an arbitrary finite field. Gabidulin introduced rank metric codes, by endowing linear codes over the extension field with a rank weight over the base field and studied…