{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005789086,0.0004434313,0.0005977384,0.00007244138,0.0002581467,0.00006801068,0.0002900604,0.0002247442,0.0001261566],"category_scores_gemma":[0.001460902,0.0002838322,0.0001398956,0.000093633,0.00008642171,0.00003680582,0.0004246595,0.0009983924,0.00005134742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000070627,"about_ca_system_score_gemma":0.00008401433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002288178,"about_ca_topic_score_gemma":0.00001862802,"domain_scores_codex":[0.997973,0.00007694205,0.0004736362,0.0005796007,0.0004642624,0.0004325318],"domain_scores_gemma":[0.9967886,0.002124714,0.0002533158,0.0005748016,0.0001063988,0.0001521946],"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.0009592446,0.0004335751,0.0006391463,0.0004261367,0.0002882649,0.0002000215,0.0008917663,0.0005801481,0.001062221,0.9791369,0.002816396,0.01256617],"study_design_scores_gemma":[0.001881109,0.0002726307,0.00279789,0.0008451096,0.0002518677,0.00003563798,0.00006698642,0.02674512,0.0009320741,0.965565,0.0000911157,0.0005154657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9388619,0.0002747593,0.05475658,0.00193825,0.0005650363,0.0007323837,0.00003998994,0.0001374823,0.002693606],"genre_scores_gemma":[0.9876542,0.00003836264,0.01084223,0.0006834895,0.0003110113,0.00003439404,0.00002397222,0.00005209905,0.000360257],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04879227,"threshold_uncertainty_score":0.9999614,"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."}}