最长连续切换的长度  

On the length of the longest consecutive switches

作　　者：郝晨旭 胡泽春[1] 马婷 HAO Chen-Xu;HU Ze-Chun;MA Ting(School of Mathematics,Sichuan University,Chengdu 610064,China)

机构地区：[1]四川大学数学学院,成都610064

出　　处：《四川大学学报（自然科学版）》2021年第2期13-21,共9页Journal of Sichuan University(Natural Science Edition)

基　　金：国家自然科学基金(11771309,11871184)。

摘　　要：作为一类简单数学模型,均匀硬币的独立抛掷模型在诸多领域具有广泛的应用,关于其最长连续头部长度的研究长期吸引着学者们,时至今日仍有大量研究致力于这个问题的推广及应用.本文研究最长连续切换的长度,给出了几个极限定理.As a class of simple mathematical models,tossing an unbiased coin independently has extensive applications in many fields.The length of the longest head-run has been long explored by many scholars.Up to now,there is still a lot of results on the extension of this problem and their applications.In this paper,we study the length of the longest consecutive switches and present several limit theorems.

关 键 词：最长连续头部 最长连续切换 极限定理 BOREL-CANTELLI引理 

分 类 号：O211.2[理学—概率论与数理统计]