{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009210248,0.004522739,0.006672591,0.006488395,0.004479866,0.01066129,0.00822019,0.006251269,0.01810783],"category_scores_gemma":[0.07462929,0.003773361,0.003404842,0.00752872,0.007382632,0.0212696,0.009264275,0.01316112,0.002310724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008577339,"about_ca_system_score_gemma":0.003112695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00418966,"about_ca_topic_score_gemma":0.004596909,"domain_scores_codex":[0.9914883,0.002045957,0.000305272,0.001588945,0.00254706,0.002024336],"domain_scores_gemma":[0.8792778,0.09828064,0.005226397,0.006207782,0.003732752,0.007274599],"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.001438361,0.0003804099,0.003504932,0.001129456,0.0003881598,0.0005839553,0.0012219,0.2023001,0.008281706,0.7272257,0.01806869,0.03547671],"study_design_scores_gemma":[0.0001004913,0.0001160402,0.0009133448,0.0001510747,0.0001602411,0.0003005973,0.0001391277,0.4209943,0.001096125,0.5721118,0.003844282,0.00007238291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2249884,0.02072429,0.669086,0.01449542,0.001076717,0.000328904,0.002989659,0.001859556,0.06445099],"genre_scores_gemma":[0.8727374,0.01014464,0.08592988,0.002076369,0.003024586,0.0009255357,0.002476544,0.001690299,0.02099475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01810783,"threshold_uncertainty_score":0.06223321,"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."}}