{"title":"On the CLT for stationary Markov chains with trivial tail sigma field","authors":"M. Peligrad","doi":"10.1214/23-ecp509","DOIUrl":null,"url":null,"abstract":"In this paper we consider stationary Markov chains with trivial two-sided tail sigma field, and prove that additive functionals satisfy the central limit theorem provided the variance of partial sums divided by n is bounded.","PeriodicalId":50543,"journal":{"name":"Electronic Communications in Probability","volume":" ","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2022-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Communications in Probability","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1214/23-ecp509","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper we consider stationary Markov chains with trivial two-sided tail sigma field, and prove that additive functionals satisfy the central limit theorem provided the variance of partial sums divided by n is bounded.
期刊介绍:
The Electronic Communications in Probability (ECP) publishes short research articles in probability theory. Its sister journal, the Electronic Journal of Probability (EJP), publishes full-length articles in probability theory. Short papers, those less than 12 pages, should be submitted to ECP first. EJP and ECP share the same editorial board, but with different Editors in Chief.