{"id":"W2046919262","doi":"10.1016/j.tcs.2010.08.010","title":"Tight bounds for the cover time of multiple random walks","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":71,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Hypercube; Mathematics; Upper and lower bounds; Random walk; Conjecture; Bounded function; Logarithm; Discrete mathematics; Random graph; Cover (algebra); Exponent; Expander graph; Order (exchange); 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001362489,0.000109679,0.0002155236,0.00003284512,0.0002682437,0.00007715595,0.0007747828,0.00004959224,0.0002552694],"category_scores_gemma":[0.003398164,0.00006190855,0.00006736263,0.0002245981,0.002084801,0.00006517387,0.0001979244,0.0001629515,0.00003115203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007934494,"about_ca_system_score_gemma":0.00007846001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.49502e-7,"about_ca_topic_score_gemma":5.44912e-7,"domain_scores_codex":[0.9987933,0.0000176593,0.0002435292,0.0002447458,0.0003943934,0.0003063812],"domain_scores_gemma":[0.9918025,0.007368821,0.00006998509,0.0003979225,0.0002523716,0.0001084719],"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.0000724388,0.00004715452,0.000001131713,0.00002332593,0.000005723884,4.370208e-7,0.0001535872,0.000004749903,0.002809303,0.9920208,0.0002400672,0.004621306],"study_design_scores_gemma":[0.000411599,0.00008450395,0.000008588298,0.000008523978,0.00001620693,0.00000498692,0.000002015971,0.4637781,0.002953553,0.5325463,0.0001293857,0.00005625102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008989113,0.000006782206,0.9891019,0.0003167444,0.000485233,0.0003327383,0.00002120704,0.00003320998,0.0007131144],"genre_scores_gemma":[0.8180845,5.155018e-7,0.1816291,0.0001206411,0.000108046,0.00001512524,4.753576e-7,0.000008406729,0.00003317011],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8090954,"threshold_uncertainty_score":0.7681535,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01530784640019461,"score_gpt":0.2870365055537961,"score_spread":0.2717286591536015,"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."}}