{"id":"W2137551726","doi":"10.1214/15-aop1030","title":"Subsequential scaling limits of simple random walk on the two-dimensional uniform spanning tree","year":2017,"lang":"en","type":"article","venue":"The Annals of Probability","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Spanning tree; Euclidean minimum spanning tree; Metric space; Minimum spanning tree; Hausdorff dimension; Random walk; Simple (philosophy); Limit (mathematics); Euclidean space; Scaling limit; Tree (set theory); Space (punctuation); Hausdorff space; Euclidean distance; Law of large numbers; Limiting; Loop-erased random walk; Combinatorics; Scaling; Discrete mathematics; Mathematical analysis; Heterogeneous random walk in one dimension; Kruskal's algorithm; Geometry; Random variable; Computer science; 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.001118636,0.0004436972,0.0005345657,0.001303395,0.0006087251,0.001258328,0.0007959142,0.00048893,0.001947116],"category_scores_gemma":[0.006886083,0.000273305,0.000551329,0.0006142457,0.001818805,0.002932091,0.001422009,0.001020042,0.0001863197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008058256,"about_ca_system_score_gemma":0.0003055065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001030749,"about_ca_topic_score_gemma":0.0006384358,"domain_scores_codex":[0.9995121,0.0001295151,0.00003305279,0.0001329278,0.0001182541,0.00007426694],"domain_scores_gemma":[0.9976876,0.0008206127,0.0005617316,0.00023201,0.0003122637,0.0003857884],"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.00004263298,0.00003839291,0.001451553,0.00008025951,0.0000270065,0.0002790299,0.0003073998,0.01892134,0.005441589,0.9689903,0.0003823025,0.004038173],"study_design_scores_gemma":[0.00001802826,0.00009823715,0.004561835,0.00003624004,0.00002601152,0.000440855,0.0002014239,0.3081145,0.003087769,0.6812093,0.002156855,0.00004891307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7620811,0.001460485,0.2233202,0.0004097103,0.00006672736,0.00003893398,0.0001277336,0.0001728078,0.01232235],"genre_scores_gemma":[0.9834837,0.0005368654,0.01337564,0.00006565491,0.00006064332,0.00004537118,0.00008626941,0.00003508237,0.002310957],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001947116,"threshold_uncertainty_score":0.006513715,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2692980894973042,"score_gpt":0.4089596156305167,"score_spread":0.1396615261332126,"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."}}