{"title":"关于平稳离散随机序列中重复次数分布的正态逼近率","authors":"V. Mikhailov, N. Mezhennaya","doi":"10.17223/20710410/58/2","DOIUrl":null,"url":null,"abstract":"The paper presents the problem of asymptotic normality of the number of r-fold repetitions of characters in a segment of a (strictly) stationary discrete random sequence on the set {1, 2,..., N} with the uniformly strong mixing property. It is shown that in the case when the uniformly strong mixing coefficient φ(t) for an arbitrarily given α > 0 decreases as t-6-α, then the distance in the uniform metric between the distribution function of the number of repetitions and the distribution function of the standard normal law decreases at a rate of O(n- δ) with increasing sequence length n for any α ∈ (0; α (32 + 4α )-1)).","PeriodicalId":42607,"journal":{"name":"Prikladnaya Diskretnaya Matematika","volume":"1 1","pages":""},"PeriodicalIF":0.2000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"About the rate of normal approximation for the distribution of the number of repetitions in a stationary discrete random sequence\",\"authors\":\"V. Mikhailov, N. Mezhennaya\",\"doi\":\"10.17223/20710410/58/2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents the problem of asymptotic normality of the number of r-fold repetitions of characters in a segment of a (strictly) stationary discrete random sequence on the set {1, 2,..., N} with the uniformly strong mixing property. It is shown that in the case when the uniformly strong mixing coefficient φ(t) for an arbitrarily given α > 0 decreases as t-6-α, then the distance in the uniform metric between the distribution function of the number of repetitions and the distribution function of the standard normal law decreases at a rate of O(n- δ) with increasing sequence length n for any α ∈ (0; α (32 + 4α )-1)).\",\"PeriodicalId\":42607,\"journal\":{\"name\":\"Prikladnaya Diskretnaya Matematika\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.2000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Prikladnaya Diskretnaya Matematika\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17223/20710410/58/2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Prikladnaya Diskretnaya Matematika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17223/20710410/58/2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
About the rate of normal approximation for the distribution of the number of repetitions in a stationary discrete random sequence
The paper presents the problem of asymptotic normality of the number of r-fold repetitions of characters in a segment of a (strictly) stationary discrete random sequence on the set {1, 2,..., N} with the uniformly strong mixing property. It is shown that in the case when the uniformly strong mixing coefficient φ(t) for an arbitrarily given α > 0 decreases as t-6-α, then the distance in the uniform metric between the distribution function of the number of repetitions and the distribution function of the standard normal law decreases at a rate of O(n- δ) with increasing sequence length n for any α ∈ (0; α (32 + 4α )-1)).
期刊介绍:
The scientific journal Prikladnaya Diskretnaya Matematika has been issued since 2008. It was registered by Federal Control Service in the Sphere of Communications and Mass Media (Registration Witness PI № FS 77-33762 in October 16th, in 2008). Prikladnaya Diskretnaya Matematika has been selected for coverage in Clarivate Analytics products and services. It is indexed and abstracted in SCOPUS and WoS Core Collection (Emerging Sources Citation Index). The journal is a quarterly. All the papers to be published in it are obligatorily verified by one or two specialists. The publication in the journal is free of charge and may be in Russian or in English. The topics of the journal are the following: 1.theoretical foundations of applied discrete mathematics – algebraic structures, discrete functions, combinatorial analysis, number theory, mathematical logic, information theory, systems of equations over finite fields and rings; 2.mathematical methods in cryptography – synthesis of cryptosystems, methods for cryptanalysis, pseudorandom generators, appreciation of cryptosystem security, cryptographic protocols, mathematical methods in quantum cryptography; 3.mathematical methods in steganography – synthesis of steganosystems, methods for steganoanalysis, appreciation of steganosystem security; 4.mathematical foundations of computer security – mathematical models for computer system security, mathematical methods for the analysis of the computer system security, mathematical methods for the synthesis of protected computer systems;[...]