English
Related papers

Related papers: On General Weighted Extropy of Ranked Set Sampling

200 papers

Starting with a set of weighted items, we want to create a generic sample of a certain size that we can later use to estimate the total weight of arbitrary subsets. For this purpose, we propose priority sampling which tested on Internet…

Data Structures and Algorithms · Computer Science 2007-05-23 Nick Duffield , Carsten Lund , Mikkel Thorup

In this work, we propose extropy measures based on density copula, distributional copula, and survival copula, and explore their properties. We study the effect of monotone transformations for the proposed measures and obtain bounds. We…

Statistics Theory · Mathematics 2024-06-04 Shital Saha , Suchandan Kayal

We consider the probability that a weighted sum of $n$ i.i.d. random variables $X_j$, $j = 1, . . ., n$, with stretched exponential tails is larger than its expectation and determine the rate of its decay, under suitable conditions on the…

Probability · Mathematics 2014-12-30 Nina Gantert , Kavita Ramanan , Franz Rembart

A common method for deriving non-parametric tests is to reformulate a parametric test in terms of sample ranks. Despite being distribution free (even in finite samples), the resulting tests often display remarkable asymptotic power…

Statistics Theory · Mathematics 2022-08-10 Dan D. Erdmann-Pham , Jonathan Terhorst , Yun S. Song

This article aims to introduced a new distribution named as extended xgamma (EXg) distribution. This generalization is derived from xgamma distribution (Xg), a special finite mixture of exponential and gamma distributions [see, Sen et al.…

Statistics Theory · Mathematics 2019-09-04 Mahendra Saha , Abhimanyu Singh Yadav , Arvind Pandey , Shivanshi Shukla , Sudhansu S Maiti

In this paper we propose a class of weighted rank correlation coefficients extending the Spearman's rho. The proposed class constructed by giving suitable weights to the distance between two sets of ranks to place more emphasis on items…

Statistics Theory · Mathematics 2020-01-22 M. Sanatgar , A. Dolati , M. Amini

The best techniques for the constrained maximum-entropy sampling problem, a discrete-optimization problem arising in the design of experiments, are via a variety of concave continuous relaxations of the objective function. A standard…

Optimization and Control · Mathematics 2023-02-13 Zhongzhu Chen , Marcia Fampa , Jon Lee

Information entropy and its extension, which are important generalization of entropy, have been applied in many research domains today. In this paper, a novel generalized relative entropy is constructed to avoid some defects of traditional…

Information Theory · Computer Science 2017-04-24 Shuai Liu , Mengye Lu , Gaocheng Liu , Zheng Pan

The paper analyzes theoretically and empirically the performance of likelihood weighting (LW) on a subset of nodes in Bayesian networks. The proposed scheme requires fewer samples to converge due to reduction in sampling variance. The…

Artificial Intelligence · Computer Science 2012-07-02 Bozhena Bidyuk , Rina Dechter

Recently, weighted cumulative residual Tsallis entropy has been introduced in the literature as a generalization of weighted cumulative residual entropy. We study some new properties of weighted cumulative residual Tsallis entropy measure.…

Statistics Theory · Mathematics 2026-02-02 Siddhartha Chakraborty , Asok K. Nanda

Comparing concentration properties of uniform sampling with and without replacement has a long history which can be traced back to the pioneer work of Hoeffding (1963). The goal of this short note is to extend this comparison to the case of…

Probability · Mathematics 2016-03-22 Anna Ben-Hamou , Yuval Peres , Justin Salez

In this paper, we consider the concept of the residual inaccuracy measure and extend it to its weighted version based on extropy. Properties of this measure are studied and the discrimination principle is applied in the class of…

Methodology · Statistics 2025-02-03 M. Hashempour , M. R. Kazemi

Given a large set $U$ where each item $a\in U$ has weight $w(a)$, we want to estimate the total weight $W=\sum_{a\in U} w(a)$ to within factor of $1\pm\varepsilon$ with some constant probability $>1/2$. Since $n=|U|$ is large, we want to do…

Data Structures and Algorithms · Computer Science 2021-10-29 Lorenzo Beretta , Jakub Tětek

Several studies demonstrate that there are critical differences between real wireless networks and simulation models. This finding has permitted to extract spatial and temporal properties for links and to provide efficient methods as biased…

Networking and Internet Architecture · Computer Science 2012-07-12 Mohamed-Haykel Zayani , Vincent Gauthier , Djamal Zeghlache

The purpose of this paper is to assess the statistical characterization of weighted networks in terms of the generalization of the relevant parameters, namely average path length, degree distribution and clustering coefficient. Although the…

Physics and Society · Physics 2007-05-23 Antoniou Ioannis , Tsompa Eleni

Rank regression offers robustness to outliers and heavy-tailed response distributions, invariance to monotonic transformations, and improved efficiency under non-Gaussian errors, making it a versatile tool for analyzing complex data. This…

Methodology · Statistics 2026-05-25 Jiyuan Tu , Suqi Wu , Yichen Zhang , Wen-Xin Zhou

The article addresses the problem of image sampling with minimal possible sampling rates and reviews the recent advances in sampling theory and methods: modern formulations of the sampling theorems, potentials and limitations of Compressed…

Image and Video Processing · Electrical Eng. & Systems 2021-10-19 L. Yaroslavsky

We investigate the Large Deviations properties of bootstrapped empirical measure with exchangeable weights. Our main result shows in great generality how the resulting rate function combines the LD properties of both the sample weights and…

Probability · Mathematics 2011-10-24 José Trashorras , Olivier Wintenberger

Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and…

Computational Complexity · Computer Science 2025-09-05 Lunjia Hu , Salil Vadhan

We consider a "length-biased" shift-dependent information measure, related to the differential entropy in which higher weight is assigned to large values of observed random variables. This allows us to introduce the notions of "weighted…

Statistics Theory · Mathematics 2011-06-27 Antonio Di Crescenzo , Maria Longobardi