{"id":"W2427484745","doi":"10.1017/jpr.2016.9","title":"Complexity bounds for Markov chain Monte Carlo algorithms via diffusion limits","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Markov chain Monte Carlo; Mathematics; Markov chain; Random walk; Algorithm; Limit (mathematics); Markov chain mixing time; Monte Carlo method; Metropolis–Hastings algorithm; Markov process; Metric (unit); Diffusion; Statistical physics; Applied mathematics; Markov model; Markov property; Statistics; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005041874,0.0003128141,0.0008307955,0.0001082686,0.0001742901,0.0000420241,0.0004173326,0.0002083218,0.00003554367],"category_scores_gemma":[0.0009544707,0.0001910686,0.0004530883,0.0001411995,0.0002341606,0.0001294279,0.0001111199,0.0002713715,1.693544e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003503587,"about_ca_system_score_gemma":0.0001229287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000063079,"about_ca_topic_score_gemma":0.00004263107,"domain_scores_codex":[0.9973204,0.0001915759,0.001155174,0.0003621489,0.0005158542,0.0004549208],"domain_scores_gemma":[0.996173,0.001486739,0.0009116749,0.000588657,0.0005630772,0.0002768475],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004395449,0.002282802,0.00156625,0.001459057,0.0004397024,0.00002096389,0.002084513,0.00001192496,0.05212355,0.08506615,0.007642491,0.8429071],"study_design_scores_gemma":[0.005949545,0.0008387158,0.00100466,0.000235035,0.0002194001,0.00006654951,0.0001872782,0.002113429,0.009316533,0.9611949,0.01823271,0.0006412897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6559533,0.0001064201,0.3369822,0.001360901,0.0007663922,0.001542638,0.00006450948,0.00006281686,0.003160835],"genre_scores_gemma":[0.5129926,0.00003155517,0.4858691,0.0001122725,0.0005096761,0.00006970524,9.322672e-7,0.00004714987,0.0003669577],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8761287,"threshold_uncertainty_score":0.779155,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09945098880932278,"score_gpt":0.3367509109275278,"score_spread":0.2372999221182051,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}