{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002106267,0.0006619141,0.0009606321,0.001436655,0.0008281959,0.001976104,0.001656011,0.0009394716,0.005275908],"category_scores_gemma":[0.007661004,0.0007512172,0.001095253,0.001482484,0.001823536,0.00257463,0.001330152,0.002170102,0.0004319235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002433444,"about_ca_system_score_gemma":0.002149769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007915922,"about_ca_topic_score_gemma":0.007159172,"domain_scores_codex":[0.9991156,0.0003944695,0.00002587383,0.0001203069,0.0001610357,0.0001827131],"domain_scores_gemma":[0.9953588,0.003644169,0.000254213,0.0001515108,0.0003758995,0.000215464],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001989279,0.00005189019,0.0002704814,0.00003398929,0.00001931034,0.0000443263,0.00009196542,0.132546,0.0003755724,0.8591518,0.001060774,0.006333936],"study_design_scores_gemma":[0.000004370644,0.000009915144,0.00007890328,0.000006766249,0.000008501554,0.00000956541,0.0000119539,0.745763,0.0001582945,0.2534589,0.0004829703,0.000006750072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01938857,0.0002053029,0.9715136,0.0004422201,0.00002988942,0.00003396207,0.0001156815,0.0001408656,0.008129833],"genre_scores_gemma":[0.7519102,0.001053922,0.218207,0.000391063,0.0004311139,0.0003996101,0.0003746643,0.0003420437,0.02689049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007915922,"threshold_uncertainty_score":0.01765597,"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."}}