AI Chat AI Image Generator AI Video Text to Speech

The maximum negative hypergeometric distribution

02/25/2018

∙

by Daniel Zelterman, et al.

∙

∙

An urn contains a known number of balls of two different colors. We describe the random variable counting the smallest number of draws needed in order to observe at least c of both colors when sampling without replacement for a pre-specified value of c=1,2,... . This distribution is the finite sample analogy to the maximum negative binomial distribution described by Zhang, Burtness, and Zelterman (2000). We describe the modes, approximating distributions, and estimation of the contents of the urn.

page 1

page 2

page 3

page 4

research

∙ 09/07/2021

Impatient PPSZ – a Faster algorithm for CSP

PPSZ is the fastest known algorithm for (d,k)-CSP problems, for most val...

0 Shibo Li, et al. ∙

research

∙ 05/21/2019

A new proof on the Ramsey number of matchings

For given simple graphs H_1,H_2,...,H_c, the Ramsey number r(H_1,H_2,......

0 Chuandong Xu, et al. ∙

research

∙ 05/03/2021

Upper bounds on the average number of colors in the non-equivalent colorings of a graph

A coloring of a graph is an assignment of colors to its vertices such th...

0 Alain Hertz, et al. ∙

research

∙ 02/23/2022

Simple models for macro-parasite distributions in hosts

Negative binomial distribution is the most used distribution to model ma...

0 Gonzalo Maximiliano Lopez, et al. ∙

research

∙ 06/09/2022

Negative Shannon Information Hides Networks

Negative numbers are essential in mathematics. They are not needed to de...

0 Ming-Xing Luo, et al. ∙

research

∙ 11/11/2020

Mastermind with a Linear Number of Queries

Since the 60's Mastermind has been studied for the combinatorial and inf...

0 Anders Martinsson, et al. ∙

research

∙ 07/01/2023

Iterative conditional replacement algorithm for conditionally specified models

The sample-based Gibbs sampler has been the dominant method for approxim...

0 Kun-Lin Kuo, et al. ∙