The Berry–Esseen Bound for General Markov Chains
A rate of convergence in the CLT is studied for recurrent Markov chains. The Berry–Esseen type bound is obtained with explicit dependence on parameters of the chain. The method of the proof is purely analytical. It is based on the complex analysis of generating functions.
Gespeichert in:
Veröffentlicht in: | Journal of mathematical sciences (New York, N.Y.) N.Y.), 2018-11, Vol.234 (6), p.829-846 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 846 |
---|---|
container_issue | 6 |
container_start_page | 829 |
container_title | Journal of mathematical sciences (New York, N.Y.) |
container_volume | 234 |
creator | Nagaev, S. V. |
description | A rate of convergence in the CLT is studied for recurrent Markov chains. The Berry–Esseen type bound is obtained with explicit dependence on parameters of the chain. The method of the proof is purely analytical. It is based on the complex analysis of generating functions. |
doi_str_mv | 10.1007/s10958-018-4050-3 |
format | Article |
fullrecord | <record><control><sourceid>gale_osti_</sourceid><recordid>TN_cdi_osti_scitechconnect_22773700</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A557425666</galeid><sourcerecordid>A557425666</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3503-4054a5d5d2fb34cd76bda6d5504f441c267d97335267facec267607dbbe03dd43</originalsourceid><addsrcrecordid>eNp1kdtKAzEQhhdRsB4ewLsFr7xYnZw27aUt9QCK4OE6pMlsu7VNNNmKvfMdfEOfxJQVSqGSixmG7wvD_Fl2QuCcAMiLSKAnugWQbsFBQMF2sg4RkhVd2RO7qQdJC8Yk388OYpxCcsou62T0eYJ5H0NY_nx9D2NEdHnfL5zNKx_ya3QY9Cy_1-HVf-SDia5dPMr2Kj2LePxXD7OXq-Hz4Ka4e7i-HVzeFYYJYKs1uBZWWFqNGDdWliOrSysE8IpzYmgpbU8yJlJTaYOrQQnSjkYIzFrODrPT9l8fm1pFUzdoJsY7h6ZRlErJJMCaegv-fYGxUVO_CC4tpighIAQVQNbUWM9Q1a7yTdBmXkejLoWQnIqyLBNVbKHG7RG8w6pO4w3-fAufnsV5bbYKZxtCYhr8bMZ6EaO6fXrcZEnLmuBjDFipt1DPdVgqAmqVuWozVylztcpcseTQ1omJdWMM62P8L_0Cdeapiw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2110552501</pqid></control><display><type>article</type><title>The Berry–Esseen Bound for General Markov Chains</title><source>SpringerLink Journals - AutoHoldings</source><creator>Nagaev, S. V.</creator><creatorcontrib>Nagaev, S. V.</creatorcontrib><description>A rate of convergence in the CLT is studied for recurrent Markov chains. The Berry–Esseen type bound is obtained with explicit dependence on parameters of the chain. The method of the proof is purely analytical. It is based on the complex analysis of generating functions.</description><identifier>ISSN: 1072-3374</identifier><identifier>EISSN: 1573-8795</identifier><identifier>DOI: 10.1007/s10958-018-4050-3</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Analysis ; CONVERGENCE ; Dependence ; FUNCTIONS ; Markov analysis ; Markov chains ; MARKOV PROCESS ; Markov processes ; Mathematical analysis ; MATHEMATICAL METHODS AND COMPUTING ; Mathematics ; Mathematics and Statistics</subject><ispartof>Journal of mathematical sciences (New York, N.Y.), 2018-11, Vol.234 (6), p.829-846</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2018</rights><rights>COPYRIGHT 2018 Springer</rights><rights>Copyright Springer Science & Business Media 2018</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c3503-4054a5d5d2fb34cd76bda6d5504f441c267d97335267facec267607dbbe03dd43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10958-018-4050-3$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10958-018-4050-3$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>230,314,780,784,885,27924,27925,41488,42557,51319</link.rule.ids><backlink>$$Uhttps://www.osti.gov/biblio/22773700$$D View this record in Osti.gov$$Hfree_for_read</backlink></links><search><creatorcontrib>Nagaev, S. V.</creatorcontrib><title>The Berry–Esseen Bound for General Markov Chains</title><title>Journal of mathematical sciences (New York, N.Y.)</title><addtitle>J Math Sci</addtitle><description>A rate of convergence in the CLT is studied for recurrent Markov chains. The Berry–Esseen type bound is obtained with explicit dependence on parameters of the chain. The method of the proof is purely analytical. It is based on the complex analysis of generating functions.</description><subject>Analysis</subject><subject>CONVERGENCE</subject><subject>Dependence</subject><subject>FUNCTIONS</subject><subject>Markov analysis</subject><subject>Markov chains</subject><subject>MARKOV PROCESS</subject><subject>Markov processes</subject><subject>Mathematical analysis</subject><subject>MATHEMATICAL METHODS AND COMPUTING</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><issn>1072-3374</issn><issn>1573-8795</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNp1kdtKAzEQhhdRsB4ewLsFr7xYnZw27aUt9QCK4OE6pMlsu7VNNNmKvfMdfEOfxJQVSqGSixmG7wvD_Fl2QuCcAMiLSKAnugWQbsFBQMF2sg4RkhVd2RO7qQdJC8Yk388OYpxCcsou62T0eYJ5H0NY_nx9D2NEdHnfL5zNKx_ya3QY9Cy_1-HVf-SDia5dPMr2Kj2LePxXD7OXq-Hz4Ka4e7i-HVzeFYYJYKs1uBZWWFqNGDdWliOrSysE8IpzYmgpbU8yJlJTaYOrQQnSjkYIzFrODrPT9l8fm1pFUzdoJsY7h6ZRlErJJMCaegv-fYGxUVO_CC4tpighIAQVQNbUWM9Q1a7yTdBmXkejLoWQnIqyLBNVbKHG7RG8w6pO4w3-fAufnsV5bbYKZxtCYhr8bMZ6EaO6fXrcZEnLmuBjDFipt1DPdVgqAmqVuWozVylztcpcseTQ1omJdWMM62P8L_0Cdeapiw</recordid><startdate>20181102</startdate><enddate>20181102</enddate><creator>Nagaev, S. V.</creator><general>Springer US</general><general>Springer</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>ISR</scope><scope>OTOTI</scope></search><sort><creationdate>20181102</creationdate><title>The Berry–Esseen Bound for General Markov Chains</title><author>Nagaev, S. V.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3503-4054a5d5d2fb34cd76bda6d5504f441c267d97335267facec267607dbbe03dd43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Analysis</topic><topic>CONVERGENCE</topic><topic>Dependence</topic><topic>FUNCTIONS</topic><topic>Markov analysis</topic><topic>Markov chains</topic><topic>MARKOV PROCESS</topic><topic>Markov processes</topic><topic>Mathematical analysis</topic><topic>MATHEMATICAL METHODS AND COMPUTING</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Nagaev, S. V.</creatorcontrib><collection>CrossRef</collection><collection>Gale In Context: Science</collection><collection>OSTI.GOV</collection><jtitle>Journal of mathematical sciences (New York, N.Y.)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Nagaev, S. V.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Berry–Esseen Bound for General Markov Chains</atitle><jtitle>Journal of mathematical sciences (New York, N.Y.)</jtitle><stitle>J Math Sci</stitle><date>2018-11-02</date><risdate>2018</risdate><volume>234</volume><issue>6</issue><spage>829</spage><epage>846</epage><pages>829-846</pages><issn>1072-3374</issn><eissn>1573-8795</eissn><abstract>A rate of convergence in the CLT is studied for recurrent Markov chains. The Berry–Esseen type bound is obtained with explicit dependence on parameters of the chain. The method of the proof is purely analytical. It is based on the complex analysis of generating functions.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10958-018-4050-3</doi><tpages>18</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1072-3374 |
ispartof | Journal of mathematical sciences (New York, N.Y.), 2018-11, Vol.234 (6), p.829-846 |
issn | 1072-3374 1573-8795 |
language | eng |
recordid | cdi_osti_scitechconnect_22773700 |
source | SpringerLink Journals - AutoHoldings |
subjects | Analysis CONVERGENCE Dependence FUNCTIONS Markov analysis Markov chains MARKOV PROCESS Markov processes Mathematical analysis MATHEMATICAL METHODS AND COMPUTING Mathematics Mathematics and Statistics |
title | The Berry–Esseen Bound for General Markov Chains |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T20%3A49%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_osti_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20Berry%E2%80%93Esseen%20Bound%20for%20General%20Markov%20Chains&rft.jtitle=Journal%20of%20mathematical%20sciences%20(New%20York,%20N.Y.)&rft.au=Nagaev,%20S.%20V.&rft.date=2018-11-02&rft.volume=234&rft.issue=6&rft.spage=829&rft.epage=846&rft.pages=829-846&rft.issn=1072-3374&rft.eissn=1573-8795&rft_id=info:doi/10.1007/s10958-018-4050-3&rft_dat=%3Cgale_osti_%3EA557425666%3C/gale_osti_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2110552501&rft_id=info:pmid/&rft_galeid=A557425666&rfr_iscdi=true |