On the computational complexity of MCMC-based estimators in large samples

From MaRDI portal
Revision as of 19:57, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2388988


DOI10.1214/08-AOS634zbMath1175.65015arXiv0704.2167MaRDI QIDQ2388988

Victor Chernozhukov, Alexandre Belloni

Publication date: 22 July 2009

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0704.2167


60J22: Computational methods in Markov chains

62F15: Bayesian inference

62M05: Markov processes: estimation; hidden Markov models

65C05: Monte Carlo methods

60G50: Sums of independent random variables; random walks

65C40: Numerical analysis or methods applied to Markov chains

65Y20: Complexity and performance of numerical algorithms


Related Items



Cites Work