✦ LIBER ✦

Tight upper tail bounds for cliques

✍ Scribed by B. Demarco; J. Kahn

Book ID: 112187418
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 184 KB
Volume: 41
Category: Article
ISSN: 1042-9832
DOI: 10.1002/rsa.20440

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bounds on Poisson tail probabiliti

Upper bounds on Poisson tail probabilities

✍ Peter W. Glynn 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Tight upper bounds for the discrepancy o

Tight upper bounds for the discrepancy of half-spaces

✍ J. Matoušek 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 441 KB

A tight upper bound for group testing in

A tight upper bound for group testing in graphs

✍ Peter Damaschke 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 481 KB

A tight upper bound on discrete entropy

✍ Wai Ho Mow 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 145 KB

Tight upper bounds on the redundancy of

Tight upper bounds on the redundancy of Huffman codes

✍ Capocelli, R.M.; De Santis, A. 📂 Article 📅 1989 🏛 IEEE 🌐 English ⚖ 770 KB

Upper bounds for the tail of the compoun

Upper bounds for the tail of the compound negative binomial distribution

✍ E.G. Willmot; X. Lin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 105 KB

A general upper bound for the tail of the compound negative binomial distribution is constructed. By establishing a connection with the individual risk mode the upper bound is seen to be a (possibly degenerate) mixture of tails of gamma distribution. The bound is sharp in that it is an equality in t