{"title":"Explicit bounds for spectral theory of geometrically ergodic Markov kernels and applications","authors":"L. Hervé, James Ledoux","doi":"10.3150/23-bej1609","DOIUrl":null,"url":null,"abstract":"In this paper, we deal with a Markov chain on a measurable state space ( X , X ) which has a transition kernel P admitting an aperiodic small-set S and satisfying the standard geometric-drift condition. Under these assumptions, there exists α 0 ∈ (0 , 1] such that PV α 0 ≤ δ α 0 V α 0 + ν ( V α 0 )1 S . Hence P is V α 0 − geometrically ergodic and its “second eigenvalue” ϱ α 0 provides the best rate of convergence. Setting R := P − ν ( · )1 S and Γ := { λ ∈ C , δ α 0 < | λ | < 1 } , ϱ α 0 is shown to satisfy, either ϱ α 0 = max (cid:8) | λ | : λ ∈ Γ , (cid:80) + ∞ k =1 λ − k ν ( R k − 1 1 S ) = 1 (cid:9) if this set is not empty, or ϱ α 0 ≤ δ α 0 . Actually the set is finite in the first case and is composed by the spectral values of P in Γ. The second case occurs when P has no spectral value in Γ. Moreover, a bound of the operator-norm of ( zI − P ) − 1 allows us to derive an explicit formula for the multiplicative constant in the rate of convergence, which can be evaluated provided that any information of the “second eigenvalue” is available. Such numerical computation is carried out for a classical family of reflected random walks. Moreover we obtain a simple and explicit bound of the operator-norm of ( I − P + π ( · )1 X ) − 1 involved in the definition of the so-called fundamental solution to Poisson’s equation. This allows us to specify the location of the eigenvalues of P and, then, to obtain a general bound on ϱ α 0 . The reversible case is also discussed. In particular, the bound of ϱ α 0 obtained for positive reversible Markov kernels is the expected one, and numerical illustrations are proposed for the Metropolis-Hastings algorithm and for the Gaussian autoregressive Markov chain. The bound for the operator-norm of ( I − P + π ( · )1 X ) − 1 is derived from an estimate, only depending on δ α 0 , of the operator-norm of ( I − R ) − 1 which provides another way to get a solution to Poisson’s equation. This estimate is also shown to be of greatest interest to generalize the error bounds obtained for perturbed discrete and atomic Markov chains in [LL18] to the case of general geometrically ergodic Markov chains. These error estimates are the simplest that can be expected in this context. All the estimates in this work are expressed in the standard V α 0 − weighted operator norm.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.3150/23-bej1609","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we deal with a Markov chain on a measurable state space ( X , X ) which has a transition kernel P admitting an aperiodic small-set S and satisfying the standard geometric-drift condition. Under these assumptions, there exists α 0 ∈ (0 , 1] such that PV α 0 ≤ δ α 0 V α 0 + ν ( V α 0 )1 S . Hence P is V α 0 − geometrically ergodic and its “second eigenvalue” ϱ α 0 provides the best rate of convergence. Setting R := P − ν ( · )1 S and Γ := { λ ∈ C , δ α 0 < | λ | < 1 } , ϱ α 0 is shown to satisfy, either ϱ α 0 = max (cid:8) | λ | : λ ∈ Γ , (cid:80) + ∞ k =1 λ − k ν ( R k − 1 1 S ) = 1 (cid:9) if this set is not empty, or ϱ α 0 ≤ δ α 0 . Actually the set is finite in the first case and is composed by the spectral values of P in Γ. The second case occurs when P has no spectral value in Γ. Moreover, a bound of the operator-norm of ( zI − P ) − 1 allows us to derive an explicit formula for the multiplicative constant in the rate of convergence, which can be evaluated provided that any information of the “second eigenvalue” is available. Such numerical computation is carried out for a classical family of reflected random walks. Moreover we obtain a simple and explicit bound of the operator-norm of ( I − P + π ( · )1 X ) − 1 involved in the definition of the so-called fundamental solution to Poisson’s equation. This allows us to specify the location of the eigenvalues of P and, then, to obtain a general bound on ϱ α 0 . The reversible case is also discussed. In particular, the bound of ϱ α 0 obtained for positive reversible Markov kernels is the expected one, and numerical illustrations are proposed for the Metropolis-Hastings algorithm and for the Gaussian autoregressive Markov chain. The bound for the operator-norm of ( I − P + π ( · )1 X ) − 1 is derived from an estimate, only depending on δ α 0 , of the operator-norm of ( I − R ) − 1 which provides another way to get a solution to Poisson’s equation. This estimate is also shown to be of greatest interest to generalize the error bounds obtained for perturbed discrete and atomic Markov chains in [LL18] to the case of general geometrically ergodic Markov chains. These error estimates are the simplest that can be expected in this context. All the estimates in this work are expressed in the standard V α 0 − weighted operator norm.
期刊介绍:
Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance.
Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.