{"id":"W2949368517","doi":"10.48550/arxiv.0912.4765","title":"Spectral dimension and random walks on the two dimensional uniform spanning tree","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Random walk; Euclidean minimum spanning tree; Mathematics; Spanning tree; Combinatorics; Dimension (graph theory); Loop-erased random walk; Minimum spanning tree; Shortest-path tree; Heterogeneous random walk in one dimension; Euclidean geometry; Tree (set theory); Euclidean distance; Simple random sample; Graph; Random graph; Discrete mathematics; Minimum degree spanning tree; Geometry; 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.0007302149,0.0005312648,0.0005313767,0.001787607,0.0006088087,0.001371199,0.0007666032,0.0006571336,0.00185851],"category_scores_gemma":[0.004235459,0.0002667216,0.0003155918,0.001053635,0.00160537,0.001895016,0.00106911,0.0007960086,0.0002219218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007604597,"about_ca_system_score_gemma":0.0002631146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000932624,"about_ca_topic_score_gemma":0.0006631523,"domain_scores_codex":[0.9996681,0.0001088799,0.00001327326,0.00005697903,0.00007556706,0.00007721565],"domain_scores_gemma":[0.9975205,0.001254568,0.0005110292,0.0001159663,0.0002031556,0.0003949117],"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.0001189492,0.00007426626,0.002865744,0.00008581973,0.00003764894,0.0002134346,0.0002483802,0.04196868,0.006450288,0.9412305,0.001130016,0.005576218],"study_design_scores_gemma":[0.00003393633,0.00006102903,0.003304864,0.00003309211,0.00001777481,0.0002406558,0.000181817,0.422635,0.001795058,0.5704042,0.001253171,0.00003932279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9009889,0.0007870249,0.08953059,0.0004841184,0.00004606859,0.00002024729,0.0001542349,0.00008467833,0.007904071],"genre_scores_gemma":[0.99231,0.0002921031,0.005823767,0.0000422704,0.00005056462,0.00002613604,0.0001013502,0.0000163737,0.001337467],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00185851,"threshold_uncertainty_score":0.006217301,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06875923583273184,"score_gpt":0.3155419336095578,"score_spread":0.246782697776826,"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."}}