Estimating a probability mass function with unknown labels
نویسندگان
چکیده
منابع مشابه
Maximum Likelihood Set for Estimating a Probability Mass Function
We propose a new method for estimating the probability mass function (pmf) of a discrete and finite random variable from a small sample. We focus on the observed counts--the number of times each value appears in the sample--and define the maximum likelihood set (MLS) as the set of pmfs that put more mass on the observed counts than on any other set of counts possible for the same sample size. W...
متن کاملOrdered Probability Mass Function
Suppose that in the four tests Alice’s scores are 90, 95, 85, 90, and Bob’s scores are 85, 95, 90, 90. How to evaluate their scores? In this paper, we introduce the concept of ordered probability mass function which can be used to find a probability mass function with smaller variance. More interestingly, we can use it to distinguish sequences of positive numbers statistically.
متن کاملAssigning labels in unknown anonymousnetworksPierre
We consider the task of distributedly assigning distinct labels to nodes of an unknown anonymous network. A priori, nodes do not have any identities (anonymous network) and do not know the topology or the size of the network (unknown network). They execute identical algorithms, apart from a distinguished node, called the source, which starts the labeling process. Our goal is to assign short lab...
متن کاملA new probability density function in earthquake occurrences
Although knowing the time of the occurrence of the earthquakes is vital and helpful, unfortunately it is still unpredictable. By the way there is an urgent need to find a method to foresee this catastrophic event. There are a lot of methods for forecasting the time of earthquake occurrence. Another method for predicting that is to know probability density function of time interval between earth...
متن کاملInformation dissemination in unknown radio networks with large labels
We consider the problems of deterministic broadcasting and gossiping in completely unknown ad-hoc radio networks. We assume that nothing is known to the nodes about the topology or even the size of the network, n, except that n > 1. Protocols for vanilla model, when n is known, may be run for increasingly larger estimates 2 on the size of the network, but one cannot determine when such a protoc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2017
ISSN: 0090-5364
DOI: 10.1214/17-aos1542