Markov chain Monte Carlo (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Markov chain Monte Carlo" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
69th place
59th place
5th place
5th place
4th place
4th place
18th place
17th place
11th place
8th place
26th place
20th place
652nd place
515th place
1,185th place
840th place
120th place
125th place
low place
9,832nd place
274th place
309th place
8,650th place
7,668th place
1,564th place
1,028th place
206th place
124th place
4,903rd place
3,679th place
low place
low place
low place
low place
207th place
136th place
3,867th place
3,957th place
1,880th place
1,218th place
485th place
440th place
low place
9,066th place
3,707th place
2,409th place

acm.org

dl.acm.org

annualreviews.org

arxiv.org

  • Robert, Christian; Casella, George (2011). "A short history of Markov chain Monte Carlo: Subjective recollections from incomplete data". Statistical Science. 26 (1): 102–115. arXiv:0808.2902. doi:10.1214/10-STS351.
  • Papaspiliopoulos, Omiros; Roberts, Gareth O.; Sköld, Martin (2007). "A general framework for the parametrization of hierarchical models". Statistical Science. 22 (1). Institute of Mathematical Statistics: 59–73. arXiv:0708.3797. doi:10.1214/088342307000000014.
  • Óli Páll Geirsson, Birgir Hrafnkelsson, and Helgi Sigurðarson (2015). "A Block Gibbs Sampling Scheme for Latent Gaussian Models." arXiv preprint [arXiv:1506.06285](https://arxiv.org/abs/1506.06285).
  • Lee, Se Yoon (2021). "Gibbs sampler and coordinate ascent variational inference: A set-theoretical review". Communications in Statistics - Theory and Methods. 51 (6): 1–21. arXiv:2008.01006. doi:10.1080/03610926.2021.1921214. S2CID 220935477.
  • Del Moral, Pierre (2006). "Sequential Monte Carlo samplers". Journal of the Royal Statistical Society. Series B (Statistical Methodology). 68 (3): 411–436. arXiv:cond-mat/0212648. doi:10.1111/j.1467-9868.2006.00553.x. S2CID 12074789.
  • Chen, S.; Dick, Josef; Owen, Art B. (2011). "Consistency of Markov chain quasi-Monte Carlo on continuous state spaces". Annals of Statistics. 39 (2): 673–701. arXiv:1105.1896. doi:10.1214/10-AOS831.
  • Kasim, M.F.; Bott, A.F.A.; Tzeferacos, P.; Lamb, D.Q.; Gregori, G.; Vinko, S.M. (September 2019). "Retrieving fields from proton radiography without source profiles". Physical Review E. 100 (3): 033208. arXiv:1905.12934. Bibcode:2019PhRvE.100c3208K. doi:10.1103/PhysRevE.100.033208. PMID 31639953. S2CID 170078861.
  • Roy, Vivekananda (2020-03-07). "Convergence Diagnostics for Markov Chain Monte Carlo". Annual Review of Statistics and Its Application. 7 (1): 387–412. arXiv:1909.11827. Bibcode:2020AnRSA...7..387R. doi:10.1146/annurev-statistics-031219-041300. ISSN 2326-8298.
  • Foreman-Mackey, Daniel; Hogg, David W.; Lang, Dustin; Goodman, Jonathan (2013-11-25). "emcee: The MCMC Hammer". Publications of the Astronomical Society of the Pacific. 125 (925): 306–312. arXiv:1202.3665. Bibcode:2013PASP..125..306F. doi:10.1086/670067. S2CID 88518555.
  • Phan, Du; Pradhan, Neeraj; Jankowiak, Martin (2019-12-24). "Composable Effects for Flexible and Accelerated Probabilistic Programming in NumPyro". arXiv:1912.11554 [stat.ML].

cmu.edu

iiif.library.cmu.edu

crcpress.com

doi.org

duke.edu

stat.duke.edu

harvard.edu

ui.adsabs.harvard.edu

ieee.org

ieeexplore.ieee.org

informs.org

pubsonline.informs.org

inria.fr

hal.inria.fr

jmlr.org

jstor.org

mlr.press

proceedings.mlr.press

nih.gov

pubmed.ncbi.nlm.nih.gov

ncbi.nlm.nih.gov

numdam.org

archive.numdam.org

  • Del Moral, Pierre; Miclo, Laurent (2000). "Branching and Interacting Particle Systems Approximations of Feynman-Kac Formulae with Applications to Non-Linear Filtering". In Jacques Azéma; Michel Ledoux; Michel Émery; Marc Yor (eds.). Séminaire de Probabilités XXXIV (PDF). Lecture Notes in Mathematics. Vol. 1729. pp. 1–145. doi:10.1007/bfb0103798. ISBN 978-3-540-67314-9.

oup.com

academic.oup.com

projecteuclid.org

proquest.com

  • Tribble, Seth D. (2007). Markov chain Monte Carlo algorithms using completely uniformly distributed driving sequences (Diss.). Stanford University. ProQuest 304808879.

psu.edu

citeseerx.ist.psu.edu

researchgate.net

semanticscholar.org

api.semanticscholar.org

springer.com

worldcat.org

search.worldcat.org