{"id":"W2319522714","doi":"10.1142/9789812777164_0009","title":"A LINEAR PROGRAM APPROACH TO ERGODICITY OF M/G/1 TYPE MARKOV CHAINS WITH A TREE STRUCTURE","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Mount Saint Vincent University; Dalhousie University","funders":"","keywords":"Markov chain; Type (biology); Ergodicity; Mathematics; Tree (set theory); Computer science; Markov process; Discrete mathematics; Combinatorics; Statistics","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.0001135565,0.0001687248,0.0002536279,0.000214138,0.00007289931,0.00004532297,0.0002261396,0.00005210124,0.0005431701],"category_scores_gemma":[0.00008507828,0.0001191617,0.0000558461,0.001345044,0.00006061391,0.0003107617,0.00009269506,0.0001059251,0.00004691643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001407778,"about_ca_system_score_gemma":0.000003963566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007216126,"about_ca_topic_score_gemma":0.0001305579,"domain_scores_codex":[0.9990767,0.000009587552,0.0001826084,0.0002840086,0.000218867,0.0002282862],"domain_scores_gemma":[0.9993351,0.00001547991,0.0001233979,0.0003305601,0.0001773345,0.00001809707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002406967,0.005064057,0.03592264,0.001996292,0.001468899,0.00005580984,0.001248877,0.08014388,0.003821762,0.3815303,0.01909884,0.4672417],"study_design_scores_gemma":[0.00175868,0.0002926785,0.003350296,0.000110129,0.000551794,0.000009206027,0.0008443937,0.9321826,0.0004672497,0.003773275,0.05551467,0.001145043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7571849,0.00004691215,0.02333895,0.0006447974,0.00007587257,0.001039015,0.000004425946,0.0006118921,0.2170532],"genre_scores_gemma":[0.9604364,0.00000111504,0.03602475,0.0006886444,0.000273902,0.00001522664,0.00001417422,0.00002668865,0.002519096],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8520387,"threshold_uncertainty_score":0.5947332,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0164055539368472,"score_gpt":0.2247439027230403,"score_spread":0.2083383487861931,"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."}}