成功的二项式尾不等式

Greg Leo
{"title":"成功的二项式尾不等式","authors":"Greg Leo","doi":"10.2139/ssrn.3057444","DOIUrl":null,"url":null,"abstract":"I provide a monotonicity result on binomial tail probabilities in terms of the number of successes. Consider two binomial processes with n trials. For any k from 1 to n-1, as long as the expected number of successes in the first process is at least n(k-1)/(n-1) and the expected number of successes in the second process is at least k/(k-1) times larger than that of the first, then the probability of k-1 or fewer successes in the first process is strictly larger than the probability of k or fewer successes in the second.","PeriodicalId":260073,"journal":{"name":"Mathematics eJournal","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Binomial Tail Inequality for Successes\",\"authors\":\"Greg Leo\",\"doi\":\"10.2139/ssrn.3057444\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"I provide a monotonicity result on binomial tail probabilities in terms of the number of successes. Consider two binomial processes with n trials. For any k from 1 to n-1, as long as the expected number of successes in the first process is at least n(k-1)/(n-1) and the expected number of successes in the second process is at least k/(k-1) times larger than that of the first, then the probability of k-1 or fewer successes in the first process is strictly larger than the probability of k or fewer successes in the second.\",\"PeriodicalId\":260073,\"journal\":{\"name\":\"Mathematics eJournal\",\"volume\":\"99 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematics eJournal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.3057444\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics eJournal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3057444","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我提供了关于成功次数的二项尾部概率的单调性结果。考虑两个n次试验的二项过程。对于从1到n-1的任意k,只要第一个进程的期望成功数至少为n(k-1)/(n-1),第二个进程的期望成功数至少为第一个进程的k/(k-1)倍,那么第一个进程成功k-1或更少的概率严格大于第二个进程成功k或更少的概率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Binomial Tail Inequality for Successes
I provide a monotonicity result on binomial tail probabilities in terms of the number of successes. Consider two binomial processes with n trials. For any k from 1 to n-1, as long as the expected number of successes in the first process is at least n(k-1)/(n-1) and the expected number of successes in the second process is at least k/(k-1) times larger than that of the first, then the probability of k-1 or fewer successes in the first process is strictly larger than the probability of k or fewer successes in the second.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信