{"id":"W2305704813","doi":"10.1016/j.matcom.2016.12.004","title":"Stratified Monte Carlo simulation of Markov chains","year":2016,"lang":"en","type":"preprint","venue":"Mathematics and Computers in Simulation","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Conseil National de la Recherche Scientifique; Agence Universitaire de la Francophonie","keywords":"Markov chain Monte Carlo; Variance reduction; Latin hypercube sampling; Markov chain; Stratified sampling; Monte Carlo method; Markov chain mixing time; Hypercube; Computer science; Mathematical optimization; State space; Variance (accounting); Hybrid Monte Carlo; Statistical physics; Sampling (signal processing); Importance sampling; Applied mathematics; Measure (data warehouse); Algorithm; Mathematics; Variable-order Markov model; Markov model; Statistics; Parallel computing; Physics; Data mining","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002719262,0.0001909279,0.0005226094,0.0002364529,0.00004349709,0.00004755566,0.0001722228,0.0002124937,0.000008495193],"category_scores_gemma":[0.00007721844,0.0002008196,0.00007819886,0.0001300405,0.00004692062,0.0000682842,0.0001832983,0.0001395228,0.000005755293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005762942,"about_ca_system_score_gemma":0.00002085022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003783296,"about_ca_topic_score_gemma":0.000008237139,"domain_scores_codex":[0.9985091,0.000003713301,0.0009102472,0.0003712251,0.00005542971,0.0001502908],"domain_scores_gemma":[0.9985118,0.0002888497,0.0007564185,0.0003379547,0.00006774507,0.00003721347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000866166,0.00009742178,0.0004374035,0.0004120186,0.00002270645,4.174065e-7,0.001105138,0.5433365,0.000003306389,0.45014,0.000003975518,0.004432397],"study_design_scores_gemma":[0.0001998221,0.00001411551,0.001481808,0.0001545939,0.000004660193,1.350251e-7,0.00001472902,0.5967366,0.000001569261,0.4012362,0.00002984784,0.0001259232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07142466,0.0003701855,0.9261482,0.00009421421,0.0002068182,0.0004723476,0.0001432593,0.00002209214,0.001118169],"genre_scores_gemma":[0.9780263,0.00003260095,0.02173712,0.00002046933,0.00008421027,0.00003940833,0.00001170405,0.00002101911,0.00002722484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9066016,"threshold_uncertainty_score":0.8189184,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03748737193020762,"score_gpt":0.2580294456577315,"score_spread":0.2205420737275239,"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."}}