{"doi":"10.1002/9781118728048.ch4","title":"Markov Chain Monte Carlo Methods","abstract":null,"journal":"An Introduction to Statistical Computing","year":2013,"id":588580,"datarank":0.3094284782545221,"base_score":1.3862943611198906,"endowment":1.3862943611198906,"self_citation_contribution":0.20794415416798362,"citation_network_contribution":0.10148432408653846,"self_endowment_contribution":0.20794415416798362,"citer_contribution":0.10148432408653846,"corpus_percentile":null,"corpus_rank":null,"citation_count":3,"citer_count":3,"citers_with_citation_signal":3,"citers_with_endowment":3,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Markov Chain Monte Carlo Methods","abstract":"Markov chains with a prescribed stationary distribution should be constructed in order to apply Markov Chain Monte Carlo (MCMC) methods. This chapter focuses on the Metropolis—Hastings method, which is a popular method to solve this problem. The resulting algorithm is similar to the rejection sampling algorithm: starting from a nearly arbitrary Markov chain, the Metropolis—Hastings algorithm generates a new Markov chain with the required stationary distribution by ‘rejecting’ some of the state transitions of the original Markov chain. The chapter discusses theoretical and practical aspects related to the convergence of MCMC methods. It states the Metropolis—Hastings algorithm for discrete state spaces. The chapter summarises the theoretical results which underpin the mathematical analysis of the resulting methods and aspects relevant to using MCMC methods in practice. Finally, it considers a variety of Bayesian inference problems, ranging from simple Bayesian models over parameter estimation for mixture distributions to applications in image processing.","is_dataset_classified":null,"base_score":1.3862943611198906,"endowment":1.3862943611198906,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"20725694","pmcid":null,"openalex_id":"https://openalex.org/W3147209356","authors":[],"funders":[],"total_grants":0,"fwci":null,"citation_percentile":null,"influential_citations":0,"citation_trend":[{"year":2017,"count":1},{"year":2019,"count":1},{"year":2021,"count":1}],"oa_status":"closed","license":"http://doi.wiley.com/10.1002/tdm_license_1.1","oa_locations":[{"url":"https://onlinelibrary.wiley.com/doi/pdf/10.1002/9781118728048.ch4","host_type":"publisher"},{"url":"https://doi.org/10.1002/9781118728048.ch4","host_type":""}],"fields_of_study":["Markov Chains and Monte Carlo Methods"],"mesh_terms":[],"keywords":["Markov chain Monte Carlo","Metropolis–Hastings algorithm","Markov chain","Computer science","Algorithm","Markov chain mixing time","Hybrid Monte Carlo","Bayesian inference","Markov model","Bayesian probability","Stationary distribution","Variable-order Markov model","Mathematics","Mathematical optimization","Artificial intelligence","Machine learning"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-07-21T23:46:30.509721Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}