Unbalanced multi-drawing urn with random addition matrix II

IF 0.9 Q3 COMPUTER SCIENCE, THEORY & METHODS
Rafik Aguech, Wissem Jedidi, Olfa Selmi
{"title":"Unbalanced multi-drawing urn with random addition matrix II","authors":"Rafik Aguech, Wissem Jedidi, Olfa Selmi","doi":"10.1080/23799927.2023.2262433","DOIUrl":null,"url":null,"abstract":"AbstractIn this paper, we give some results about a multi-drawing urn with random addition matrix. The process that we study is described as: at stage n≥1, we pick out at random m balls, say k white balls and m−k black balls. We inspect the colours and then we return the balls, according to a predefined replacement matrix, together with (m−k)Xn white balls and kYn black balls. Here, we extend the classical assumption that the random variables (Xn,Yn) are bounded and i.i.d. We prove a strong law of large numbers and a central limit theorem on the proportion of white balls for the total number of balls after n draws under the following more general assumptions: (i) a finite second-order moment condition in the i.i.d. case; (ii) regular variation type for the first and second moments in the independent case.Keywords: Central limit theoremmartingaleregular variationunbalanced urnstochastic algorithmstrong law of large numbers AcknowledgementsThe authors would like to extend their sincere appreciation to the Deanship of Scientific Research at King Saud University for funding their Research group No. (RG-1441-317).Disclosure statementNo potential conflict of interest was reported by the author(s).Additional informationFundingThis work was supported by the Deanship of Scientific Research at King Saud University for funding their Research group No. (RG-1441-317).","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2023-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Mathematics: Computer Systems Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23799927.2023.2262433","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

AbstractIn this paper, we give some results about a multi-drawing urn with random addition matrix. The process that we study is described as: at stage n≥1, we pick out at random m balls, say k white balls and m−k black balls. We inspect the colours and then we return the balls, according to a predefined replacement matrix, together with (m−k)Xn white balls and kYn black balls. Here, we extend the classical assumption that the random variables (Xn,Yn) are bounded and i.i.d. We prove a strong law of large numbers and a central limit theorem on the proportion of white balls for the total number of balls after n draws under the following more general assumptions: (i) a finite second-order moment condition in the i.i.d. case; (ii) regular variation type for the first and second moments in the independent case.Keywords: Central limit theoremmartingaleregular variationunbalanced urnstochastic algorithmstrong law of large numbers AcknowledgementsThe authors would like to extend their sincere appreciation to the Deanship of Scientific Research at King Saud University for funding their Research group No. (RG-1441-317).Disclosure statementNo potential conflict of interest was reported by the author(s).Additional informationFundingThis work was supported by the Deanship of Scientific Research at King Saud University for funding their Research group No. (RG-1441-317).
随机加法矩阵的不平衡多拉缸ⅱ
摘要本文给出了带有随机加法矩阵的多图瓮的一些结果。我们研究的过程描述为:在阶段n≥1时,我们随机挑选m个球,例如k个白球和m - k个黑球。我们检查颜色,然后我们返回球,根据一个预定义的替换矩阵,连同(m−k)Xn白球和kYn黑球。在这里,我们推广了随机变量(Xn,Yn)是有界的和i.i.d的经典假设。在以下更一般的假设下,我们证明了n抽取后白球占总球数的比例的一个强大数定律和一个中心极限定理:(i) i.i.d情况下二阶矩的有限条件;(ii)独立情况下第一阶矩和第二阶矩的正则变化类型。关键词:中心极限定理,鞅,正则变分,非平衡非随机算法,强大数定律致谢作者衷心感谢沙特国王大学科学研究主任对他们的研究小组的资助。(rg - 1441 - 317)。披露声明作者未报告潜在的利益冲突。本研究得到了沙特国王大学科学研究主任的支持,为他们的研究小组提供资金。(rg - 1441 - 317)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Computer Mathematics: Computer Systems Theory
International Journal of Computer Mathematics: Computer Systems Theory Computer Science-Computational Theory and Mathematics
CiteScore
1.80
自引率
0.00%
发文量
11
×
引用
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学术官方微信