检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Chen Xu HAO Ting MA
机构地区:[1]College of Mathematics,Sichuan University,Chengdu 610065,P.R.China
出 处:《Acta Mathematica Sinica,English Series》2023年第6期1138-1146,共9页数学学报(英文版)
基 金:Supported by the National National Science Foundation of China(Grant Nos.12101429,12171335);the Science Development Project of Sichuan University(Grant No.2020SCUNL201);the Fundamental Research Funds for the Central Universities of China。
摘 要:In this paper we mainly discuss lower and upper bounds for the length of longest consecutive switches inⅡD Bernoulli sequences.This work is an extension of results for longest consecutive switches in unbiased coin-tossing,and might be applied to reliability theory,biology,quality control,pattern recognition,finance,etc.
关 键 词:Longest consecutive switches lower and upper bounds Borel-Cantelli lemma
分 类 号:O211.4[理学—概率论与数理统计]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7