MétaCan
Menu
Back to cohort
Record W2607925462 · doi:10.1063/1.5093799

Coalescence of geodesics in exactly solvable models of last passage percolation

2019· preprint· en· W2607925462 on OpenAlexaff
Riddhipratim Basu, Sourav Sarkar, Allan Sly

Bibliographic record

VenueJournal of Mathematical Physics · 2019
Typepreprint
Languageen
FieldMathematics
TopicRandom Matrices and Applications
Canadian institutionsUniversity of Toronto
FundersNational Science Foundation
KeywordsGeodesicCombinatoricsCoalescence (physics)MathematicsUpper and lower boundsPoint processExponential functionPercolation thresholdMathematical physicsPhysicsGeometryMathematical analysisQuantum mechanicsStatistics

Abstract

fetched live from OpenAlex

Coalescence of semi-infinite geodesics remains a central question in planar first passage percolation. In this paper, we study finer properties of the coalescence structure of finite and semi-infinite geodesics for exactly solvable models of last passage percolation. Consider directed last passage percolation on Z2 with independent and identically distributed exponential weights on the vertices. Fix two points v1 = (0, 0) and v2 = (0, k2/3) for some k > 0, and consider the maximal paths Γ1 and Γ2 starting at v1 and v2, respectively, to the point (n, n) for n ≫ k. Our object of study is the point of coalescence, i.e., the point v ∈ Γ1 ∩ Γ2 with smallest |v|1. We establish that the distance to coalescence |v|1 scales as k, by showing the upper tail bound P(|v|1>Rk)≤R−c for some c > 0. We also consider the problem of coalescence for semi-infinite geodesics. For the almost surely unique semi-infinite geodesics in the direction (1, 1) starting from v3 = (−k2/3, k2/3) and v4 = (k2/3, −k2/3), we establish the optimal tail estimate P(|v|1>Rk)≍R−2/3, for the point of coalescence v. This answers a question left open by Pimentel [Ann. Probab. 44(5), 3187–3206 (2016)] who proved the corresponding lower bound.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.015
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.005
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.015
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0020.004
Scholarly communication0.0030.005
Open science0.0020.003
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0030.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.076
GPT teacher head0.326
Teacher spread0.250 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations11
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Mathematical PhysicsSame topicRandom Matrices and ApplicationsFrench-language works237,207