On the Geometry of the Last Passage Percolation Problem

Eric Cator; Tom Alberts

arxiv: 1907.00407 · v1 · pith:HEB7FAZInew · submitted 2019-06-30 · 🧮 math.PR

On the Geometry of the Last Passage Percolation Problem

Tom Alberts , Eric Cator This is my paper

Pith reviewed 2026-05-25 12:37 UTC · model grok-4.3

classification 🧮 math.PR

keywords last passage percolationpolyhedral conespassage timesweight spaceorder conepartially ordered setsextremal pathspointed cones

0 comments

The pith

The regions of weight space where a particular path is longest in last passage percolation are pointed polyhedral cones whose structure is determined by the model.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper treats the last passage time as a piecewise linear function of the weights on the points of a finite partially ordered set. It identifies the domains in which a given path achieves the maximum passage time. When all weights are positive these domains are pointed polyhedral cones. The authors find the extreme rays, facets and two-dimensional faces of each cone by using only the last passage rules, and they describe the simplicial decomposition of the largest cones through the order cone. This geometry is developed to calculate the probabilities that extremal corner paths occur on boxes in the integer grid, though the arguments work for any finite poset.

Core claim

When weights are positive the set of weight vectors making a given path the unique longest one forms a pointed polyhedral cone in weight space. The extreme rays, facets and two-dimensional faces of these cones are characterized using last passage percolation arguments, and the maximal cones admit a well-known simplicial decomposition via the order cone. All properties are derived directly from the last passage model and apply to general finite partially ordered sets.

What carries the argument

The pointed polyhedral cones that form the domains of linearity for the passage time function, each corresponding to a particular path being maximal.

If this is right

The extreme rays and facets of each cone can be listed explicitly from the partial order relations among the points.
Path probabilities are obtained by integrating the weight distribution over the corresponding cone.
The order cone provides a simplicial decomposition that triangulates the space of all weight vectors.
Results hold for arbitrary finite posets, allowing the same geometric analysis beyond grid graphs.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

These cone descriptions could be used to derive exact path probability formulas for small grids by direct integration.
Similar cone structures might appear in other optimization problems over posets such as longest increasing subsequences.
Computational verification on small posets would confirm whether the listed rays and facets match the actual domains.

Load-bearing premise

All weights are assumed positive so that each domain is a pointed polyhedral cone.

What would settle it

A positive weight vector for which the set of weights making one specific path longest fails to be a pointed polyhedral cone, or has rays or facets different from those described, would show the geometric characterization is incomplete.

read the original abstract

We analyze the geometrical structure of the passage times in the last passage percolation model. Viewing the passage time as a piecewise linear function of the weights we determine the domains of the various pieces, which are the subsets of the weight space that make a given path the longest one. We focus on the case when all weights are assumed to be positive, and as a result each domain is a pointed polyhedral cone. We determine the extreme rays, facets, and two-dimensional faces of each cone, and also review a well-known simplicial decomposition of the maximal cones via the so-called order cone. All geometric properties are derived using arguments phrased in terms of the last passage model itself. Our motivation is to understand path probabilities of the extremal corner paths on boxes in $\Z^2$, but all of our arguments apply to general, finite partially ordered sets.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This paper gives a model-specific description of the pointed polyhedral cones for maximizing paths in last-passage percolation on finite posets, identifying rays, facets and 2-faces via direct comparisons.

read the letter

The main takeaway is that the authors characterize the domains in weight space where a given path is the longest one, for positive weights on a general finite poset. They locate the extreme rays, facets, and two-dimensional faces of each such cone and review the simplicial decomposition through the order cone, all derived from last-passage comparisons rather than imported polyhedral results. This keeps the arguments internal to the model and could be convenient for exact path-probability calculations, such as those for corner paths on a grid. The positive-weight restriction is stated at the outset and ensures the cones are pointed, which is handled cleanly. The work is narrow by construction. It supplies geometry but does not produce new probability formulas or address broader questions like fluctuations. The motivation about Z^2 corner paths is noted without being pursued. From the abstract and stress-test description the logic appears direct with no circularity or unstated assumptions. A referee would still want to inspect the actual derivations for completeness. This is aimed at specialists already working on last-passage percolation on posets who need the cone structure for further exact computations. Readers outside that niche will see little of interest. The paper is worth sending to referees because the claims are concrete and the setting is standard enough for specialists to verify.

Referee Report

0 major / 3 minor

Summary. The paper analyzes the geometric structure of domains in weight space where a given path realizes the maximum passage time in the last-passage percolation model on a finite poset. Restricting to positive weights, these domains are pointed polyhedral cones; the authors determine the extreme rays, facets, and two-dimensional faces of each cone via direct last-passage comparisons, and review the simplicial decomposition of maximal cones by the order cone. All arguments are phrased intrinsically in terms of the LPP model and apply to general finite posets, with motivation from extremal corner paths on boxes in Z^2.

Significance. If the derivations hold, the work supplies a model-intrinsic description of the conical domains and their facial structure for LPP on posets, which may facilitate exact or asymptotic computations of path probabilities. The explicit use of last-passage comparisons rather than external combinatorial machinery is a methodological strength, and the extension to arbitrary finite posets broadens applicability beyond the grid case.

minor comments (3)

[§1] §1 (Introduction): the transition from the Z^2 box motivation to the general-poset setting is stated but not illustrated with a small example; adding a two-element poset or 2x2 grid diagram would clarify how the cone geometry specializes.
The review of the order-cone decomposition (mentioned in the abstract and presumably in §4 or §5) cites it as 'well-known' but does not provide a self-contained reference or a one-paragraph recap of the simplicial property; a short citation or sketch would aid readers unfamiliar with the construction.
Notation for the weight vector and the passage-time function is introduced without an explicit equation number in the early sections; cross-referencing the definition of the domain C_π would improve readability.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of the manuscript, recognition of its methodological strengths, and recommendation for minor revision. Since no specific major comments were raised, we address the report as a whole below.

Circularity Check

0 steps flagged

No significant circularity; direct structural derivation from model

full rationale

The paper performs a direct geometric analysis of domains in the last passage percolation model on a finite poset, deriving extreme rays, facets, and 2-faces from passage time comparisons under the positive-weights assumption that makes domains pointed polyhedral cones. The simplicial decomposition via the order cone is explicitly reviewed as a known fact rather than derived. No equations reduce claims to fitted inputs, self-definitions, or load-bearing self-citations; all arguments are phrased internally to the last-passage model on the stated poset. This matches the default expectation of a self-contained mathematical derivation with no circular reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work rests on standard properties of finite partially ordered sets and the definition of last passage times; no free parameters, invented entities, or ad-hoc axioms are introduced in the abstract.

axioms (2)

domain assumption Finite partially ordered sets admit well-defined last passage times as maxima over paths.
Invoked throughout the abstract as the setting for the model.
domain assumption Positive weights make each maximal domain a pointed polyhedral cone.
Stated explicitly as the case under study.

pith-pipeline@v0.9.0 · 5667 in / 1325 out tokens · 42599 ms · 2026-05-25T12:37:47.100997+00:00 · methodology

On the Geometry of the Last Passage Percolation Problem

Core claim

What carries the argument

If this is right

Where Pith is reading between the lines

Load-bearing premise

What would settle it

discussion (0)