{"title":"用马尔可夫链计算统计分布","authors":"A. M. Zubkov, M. Filina","doi":"10.1515/dma-2022-0024","DOIUrl":null,"url":null,"abstract":"Abstract An approach to the construction of efficient algorithms for the exact computation of distributions of statistics by means of the Markov chains is described. The Pearson statistic, the number of empty cells for random allocations of particles, and the Kolmogorov – Smirnov statistic are considered as examples. Possibilities of extending the approach are discussed, in particular to the computation of the joint distributions of statistics.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":"32 1","pages":"285 - 295"},"PeriodicalIF":0.3000,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Computation of distributions of statistics by means of Markov chains\",\"authors\":\"A. M. Zubkov, M. Filina\",\"doi\":\"10.1515/dma-2022-0024\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract An approach to the construction of efficient algorithms for the exact computation of distributions of statistics by means of the Markov chains is described. The Pearson statistic, the number of empty cells for random allocations of particles, and the Kolmogorov – Smirnov statistic are considered as examples. Possibilities of extending the approach are discussed, in particular to the computation of the joint distributions of statistics.\",\"PeriodicalId\":11287,\"journal\":{\"name\":\"Discrete Mathematics and Applications\",\"volume\":\"32 1\",\"pages\":\"285 - 295\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2022-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/dma-2022-0024\",\"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":"Discrete Mathematics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/dma-2022-0024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Computation of distributions of statistics by means of Markov chains
Abstract An approach to the construction of efficient algorithms for the exact computation of distributions of statistics by means of the Markov chains is described. The Pearson statistic, the number of empty cells for random allocations of particles, and the Kolmogorov – Smirnov statistic are considered as examples. Possibilities of extending the approach are discussed, in particular to the computation of the joint distributions of statistics.
期刊介绍：
The aim of this journal is to provide the latest information on the development of discrete mathematics in the former USSR to a world-wide readership. The journal will contain papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications will cover various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
