{"id":"W205074548","doi":"10.46298/dmtcs.3342","title":"Random Infinite Permutations and the Cyclic Time Random Walk","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Random walk; Combinatorics; Mathematics; Vertex (graph theory); Random graph; Random regular graph; Heterogeneous random walk in one dimension; Discrete mathematics; Graph; Statistics; Line graph; 1-planar graph","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.001027335,0.0004869405,0.0005655535,0.001080947,0.0008551613,0.001539078,0.0008270655,0.001391931,0.005805919],"category_scores_gemma":[0.005491477,0.0002441841,0.000593406,0.0009892997,0.003003759,0.002883935,0.001200152,0.001425823,0.0008401201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009914718,"about_ca_system_score_gemma":0.0008620732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002438921,"about_ca_topic_score_gemma":0.001568306,"domain_scores_codex":[0.9991195,0.0003189827,0.00003390387,0.0001418565,0.0002373149,0.0001484944],"domain_scores_gemma":[0.9975049,0.001291324,0.0003794181,0.0003116939,0.0002507631,0.0002619062],"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.000009280883,0.00000545775,0.00009712105,0.0000105555,0.000002813842,0.00004916624,0.00003113482,0.004454267,0.0001190807,0.9925957,0.0006543385,0.001971118],"study_design_scores_gemma":[0.000008361649,0.00000826916,0.00009302832,0.000007744175,0.000002451954,0.00006239804,0.00001278074,0.02386112,0.00007245758,0.9723529,0.003510158,0.000008387125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2124671,0.008144046,0.5971152,0.007253959,0.001157868,0.0001790625,0.0008900998,0.0005742479,0.1722184],"genre_scores_gemma":[0.9249133,0.003182588,0.03607895,0.001039276,0.0009028971,0.000265723,0.0004620255,0.0001272242,0.0330279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005805919,"threshold_uncertainty_score":0.01942271,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01415781025183799,"score_gpt":0.2782584065970568,"score_spread":0.2641005963452188,"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."}}