A new proof of convergence of MCMC via the ergodic theorem (Q634566): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.spl.2011.05.004 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.spl.2011.05.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057777714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic simulation: Algorithms and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov chains and stochastic stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Irreducible Markov Chains and Non-Negative Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General state space Markov chains and MCMC algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov chains for exploring posterior distributions. (With discussion) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.SPL.2011.05.004 / rank
 
Normal rank

Latest revision as of 23:10, 9 December 2024

scientific article
Language Label Description Also known as
English
A new proof of convergence of MCMC via the ergodic theorem
scientific article

    Statements

    A new proof of convergence of MCMC via the ergodic theorem (English)
    0 references
    0 references
    0 references
    16 August 2011
    0 references
    Markov chain Monte Carlo methods (MCMC) are considered. In this approach, the authors construct a Markov chain \(X=(X_n : n \geq 0)\) having a prescribed stationary distribution \(\pi\). By simulating a trajectory of \(X\) over \({0, 1, \ldots, n-1}\), the hope is that the time average \(n^{-1} \sum_{j=0}^{n-1} f(X_j)\) will converge to \(\int_S f(x) \pi(d x)\), where \(S\) is the state space. Such property is known for an irreducible discrete state space Markov chain, while the authors consider a general state space. A key result underlaying the theory of MCMC is that any \(\eta\)-irreducible Markov chain having a transition density with respect to \(\eta\) and possessing a stationary distribution \(\pi\) is automatically positive Harris current. The paper provides a short self-contained proof of this fact, using the ergodic theorem as the most advanced tool.
    0 references
    0 references
    Markov chain Monte Carlo method
    0 references
    Harris recurrence
    0 references
    eta-irreducibility
    0 references
    ergodic theorem
    0 references

    Identifiers