{"id":"https://openalex.org/W2949741257","doi":"https://doi.org/10.1017/s0021900200113452","title":"On the convergence rates of some adaptive Markov chain Monte Carlo algorithms","display_name":"On the convergence rates of some adaptive Markov chain Monte Carlo algorithms","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W2949741257","doi":"https://doi.org/10.1017/s0021900200113452","mag":"2949741257"},"language":"en","primary_location":{"id":"doi:10.1017/s0021900200113452","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0021900200113452","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/A1FA63E22C84FA0928653622AAF49903/S0021900200113452a.pdf/div-class-title-on-the-convergence-rates-of-some-adaptive-markov-chain-monte-carlo-algorithms-div.pdf","source":{"id":"https://openalex.org/S160779208","display_name":"Journal of Applied Probability","issn_l":"0021-9002","issn":["0021-9002","1475-6072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Probability","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/A1FA63E22C84FA0928653622AAF49903/S0021900200113452a.pdf/div-class-title-on-the-convergence-rates-of-some-adaptive-markov-chain-monte-carlo-algorithms-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070206514","display_name":"Yves F. Atchad\u00e9","orcid":"https://orcid.org/0000-0002-0487-6136"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yves Atchad\u00e9","raw_affiliation_strings":["University of Michigan, Ann Arbor"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059718319","display_name":"Yizao Wang","orcid":"https://orcid.org/0000-0002-6549-588X"},"institutions":[{"id":"https://openalex.org/I63135867","display_name":"University of Cincinnati","ror":"https://ror.org/01e3m7079","country_code":"US","type":"education","lineage":["https://openalex.org/I63135867"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yizao Wang","raw_affiliation_strings":["University of Cincinnati"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Cincinnati","institution_ids":["https://openalex.org/I63135867"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059718319","https://openalex.org/A5070206514"],"corresponding_institution_ids":["https://openalex.org/I27837315","https://openalex.org/I63135867"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.24851577,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"52","issue":"03","first_page":"811","last_page":"825"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10136","display_name":"Statistical Methods and Inference","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.8941648602485657},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.704578161239624},{"id":"https://openalex.org/keywords/mixing","display_name":"Mixing (physics)","score":0.6827934980392456},{"id":"https://openalex.org/keywords/parallel-tempering","display_name":"Parallel tempering","score":0.6809794902801514},{"id":"https://openalex.org/keywords/resampling","display_name":"Resampling","score":0.670090913772583},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6305700540542603},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6233159303665161},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.5966529846191406},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5701931715011597},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5505228638648987},{"id":"https://openalex.org/keywords/metropolis\u2013hastings-algorithm","display_name":"Metropolis\u2013Hastings algorithm","score":0.5090839266777039},{"id":"https://openalex.org/keywords/markov-chain-mixing-time","display_name":"Markov chain mixing time","score":0.42506492137908936},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38046735525131226},{"id":"https://openalex.org/keywords/hybrid-monte-carlo","display_name":"Hybrid Monte Carlo","score":0.37217581272125244},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.3645968437194824},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.34158894419670105},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.2537682056427002},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22290509939193726},{"id":"https://openalex.org/keywords/variable-order-markov-model","display_name":"Variable-order Markov model","score":0.2167913317680359},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.05893129110336304}],"concepts":[{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.8941648602485657},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.704578161239624},{"id":"https://openalex.org/C138777275","wikidata":"https://www.wikidata.org/wiki/Q6884054","display_name":"Mixing (physics)","level":2,"score":0.6827934980392456},{"id":"https://openalex.org/C187653413","wikidata":"https://www.wikidata.org/wiki/Q7135015","display_name":"Parallel tempering","level":5,"score":0.6809794902801514},{"id":"https://openalex.org/C150921843","wikidata":"https://www.wikidata.org/wiki/Q1170431","display_name":"Resampling","level":2,"score":0.670090913772583},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6305700540542603},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6233159303665161},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.5966529846191406},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5701931715011597},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5505228638648987},{"id":"https://openalex.org/C204693719","wikidata":"https://www.wikidata.org/wiki/Q910810","display_name":"Metropolis\u2013Hastings algorithm","level":4,"score":0.5090839266777039},{"id":"https://openalex.org/C97074811","wikidata":"https://www.wikidata.org/wiki/Q6771322","display_name":"Markov chain mixing time","level":5,"score":0.42506492137908936},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38046735525131226},{"id":"https://openalex.org/C13153151","wikidata":"https://www.wikidata.org/wiki/Q1639846","display_name":"Hybrid Monte Carlo","level":4,"score":0.37217581272125244},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.3645968437194824},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.34158894419670105},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.2537682056427002},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22290509939193726},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.2167913317680359},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.05893129110336304},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0021900200113452","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0021900200113452","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/A1FA63E22C84FA0928653622AAF49903/S0021900200113452a.pdf/div-class-title-on-the-convergence-rates-of-some-adaptive-markov-chain-monte-carlo-algorithms-div.pdf","source":{"id":"https://openalex.org/S160779208","display_name":"Journal of Applied Probability","issn_l":"0021-9002","issn":["0021-9002","1475-6072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Probability","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s0021900200113452","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0021900200113452","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/A1FA63E22C84FA0928653622AAF49903/S0021900200113452a.pdf/div-class-title-on-the-convergence-rates-of-some-adaptive-markov-chain-monte-carlo-algorithms-div.pdf","source":{"id":"https://openalex.org/S160779208","display_name":"Journal of Applied Probability","issn_l":"0021-9002","issn":["0021-9002","1475-6072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Probability","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.46000000834465027,"id":"https://metadata.un.org/sdg/7"}],"awards":[{"id":"https://openalex.org/G2095129052","display_name":"Faster Mixing Markov Chain Monte Carlo for Multidimensional IRT and Cognitive Diagnosis Models","funder_award_id":"1229261","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2949741257.pdf","grobid_xml":"https://content.openalex.org/works/W2949741257.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W1501976809","https://openalex.org/W1509689762","https://openalex.org/W1678460021","https://openalex.org/W1972913069","https://openalex.org/W1973594349","https://openalex.org/W1993281951","https://openalex.org/W2001464954","https://openalex.org/W2029079906","https://openalex.org/W2051926102","https://openalex.org/W2060485493","https://openalex.org/W2069605605","https://openalex.org/W2085750643","https://openalex.org/W2105878523","https://openalex.org/W2160639001","https://openalex.org/W2166461660","https://openalex.org/W3098702265","https://openalex.org/W3102568850","https://openalex.org/W3122343732"],"related_works":["https://openalex.org/W2146960149","https://openalex.org/W1483435625","https://openalex.org/W4226314133","https://openalex.org/W4321147629","https://openalex.org/W1485740725","https://openalex.org/W2279122170","https://openalex.org/W2949171124","https://openalex.org/W2007883828","https://openalex.org/W1502464768","https://openalex.org/W1844038169"],"abstract_inverted_index":{"In":[0],"this":[1,56],"paper":[2],"we":[3,21,51],"study":[4,67],"the":[5,24,36,68,76],"mixing":[6,83],"time":[7,84],"of":[8,27,35,48,75,86],"certain":[9],"adaptive":[10],"Markov":[11],"chain":[12],"Monte":[13],"Carlo":[14],"(MCMC)":[15],"algorithms.":[16],"Under":[17],"some":[18],"regularity":[19],"conditions,":[20],"show":[22],"that":[23,81],"convergence":[25],"rate":[26],"importance":[28],"resampling":[29],"MCMC":[30],"algorithms,":[31],"measured":[32],"in":[33,54],"terms":[34],"total":[37],"variation":[38],"distance,":[39],"is":[40,85],"O":[41,88],"(":[42,89],"n":[43,90],"-1":[44],").":[45,92],"By":[46],"means":[47],"an":[49],"example,":[50],"establish":[52,80],"that,":[53],"general,":[55],"algorithm":[57],"does":[58],"not":[59],"converge":[60],"at":[61],"a":[62,72],"faster":[63],"rate.":[64],"We":[65],"also":[66],"interacting":[69],"tempering":[70],"algorithm,":[71],"simplified":[73],"version":[74],"equi-energy":[77],"sampler,":[78],"and":[79],"its":[82],"order":[87],"-1/2":[91]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}