{"id":"W2109416465","doi":"","title":"A Combinatorial Approach to Nearly Uncoupled Markov Chains","year":2011,"lang":"en","type":"dissertation","venue":"Arrow@dit (Dublin Institute of Technology)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National University of Ireland; University of Regina","keywords":"Markov chain; Mathematics; Additive Markov chain; Markov chain mixing time; Invariant (physics); Markov property; Combinatorics; Disjoint sets; Markov process; State space; Complement (music); Markov model; Discrete mathematics; Variable-order Markov model; Markov renewal process; Random variable; Statistics","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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004768308,0.0006010829,0.00083324,0.002226761,0.0002220996,0.0002245626,0.005985836,0.0009283834,0.00001978152],"category_scores_gemma":[0.0002283194,0.0006143433,0.0002144599,0.002850237,0.0002062046,0.001389793,0.0009509107,0.0007596904,0.0001672864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008483884,"about_ca_system_score_gemma":0.0003043008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001973587,"about_ca_topic_score_gemma":0.0001093861,"domain_scores_codex":[0.9965439,0.00002380496,0.0008091138,0.001297896,0.0006597112,0.0006656018],"domain_scores_gemma":[0.9965144,0.00001486016,0.000600079,0.002346959,0.0003630762,0.0001606293],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005344023,0.0004851931,0.00004450797,0.0002172057,0.0001854683,0.00003804692,0.0002694333,0.000008454995,0.0002390139,0.9318002,0.01065479,0.0560042],"study_design_scores_gemma":[0.006621053,0.001824361,0.001282388,0.0009690975,0.0004767647,0.00003911523,0.0009108501,0.01290364,0.01354545,0.1185634,0.8382816,0.004582275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.1681943,0.001206343,0.3070496,0.003056512,0.08402497,0.0073762,0.0003068587,0.006429547,0.4223556],"genre_scores_gemma":[0.3691354,0.0003390886,0.5910161,0.0004597467,0.001330809,0.001382882,0.004163564,0.0002603171,0.0319121],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8276268,"threshold_uncertainty_score":0.9996308,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01559442246004874,"score_gpt":0.236152012667885,"score_spread":0.2205575902078363,"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."}}