A limit theorem for runs containing two types of contaminations

IF 0.6 3区 数学 Q3 MATHEMATICS Periodica Mathematica Hungarica Pub Date : 2024-07-06 DOI:10.1007/s10998-024-00600-6
István Fazekas, Borbála Fazekas, Michael Ochieng Suja
{"title":"A limit theorem for runs containing two types of contaminations","authors":"István Fazekas, Borbála Fazekas, Michael Ochieng Suja","doi":"10.1007/s10998-024-00600-6","DOIUrl":null,"url":null,"abstract":"<p>In this paper, sequences of trials having three outcomes are studied. The outcomes are labelled as success, failure of type I and failure of type II. A run is called at most <span>\\(1+1\\)</span> contaminated, if it contains at most one failure of type I and at most one failure of type II. The accompanying distribution for the length of the longest at most <span>\\(1+1\\)</span> contaminated run is obtained. The proof is based on a powerful lemma of Csáki, Földes and Komlós. Besides a mathematical proof, simulation results supporting our theorem are also presented.</p>","PeriodicalId":49706,"journal":{"name":"Periodica Mathematica Hungarica","volume":"50 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Periodica Mathematica Hungarica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10998-024-00600-6","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, sequences of trials having three outcomes are studied. The outcomes are labelled as success, failure of type I and failure of type II. A run is called at most \(1+1\) contaminated, if it contains at most one failure of type I and at most one failure of type II. The accompanying distribution for the length of the longest at most \(1+1\) contaminated run is obtained. The proof is based on a powerful lemma of Csáki, Földes and Komlós. Besides a mathematical proof, simulation results supporting our theorem are also presented.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
包含两类污染的运行极限定理
本文研究了具有三种结果的试验序列。这些结果被标记为成功、I 型失败和 II 型失败。如果一个序列中最多包含一次 I 型失败和一次 II 型失败,那么这个序列就被称为 "最多(1+1)污染 "序列。由此可以得到最长的最多(1+1)次污染运行的长度分布。证明基于 Csáki、Földes 和 Komlós 的一个强大的lemma。除了数学证明外,还给出了支持我们定理的模拟结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.40
自引率
0.00%
发文量
67
审稿时长
>12 weeks
期刊介绍: Periodica Mathematica Hungarica is devoted to publishing research articles in all areas of pure and applied mathematics as well as theoretical computer science. To be published in the Periodica, a paper must be correct, new, and significant. Very strong submissions (upon the consent of the author) will be redirected to Acta Mathematica Hungarica. Periodica Mathematica Hungarica is the journal of the Hungarian Mathematical Society (János Bolyai Mathematical Society). The main profile of the journal is in pure mathematics, being open to applied mathematical papers with significant mathematical content.
期刊最新文献
Quasi-quadratic modules in pseudo-valuation domain Sums of multidimensional Kloosterman sums In memoriam Pál Révész (1934–2022) On the difference bases of $$\mathbb {Z}_{m}$$ On 2-Killing vector fields in almost contact metric geometry
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1