Limit shapes of bumping routes in the Robinson-Schensted correspondence

TL;DR

This paper establishes a limit shape theorem for bumping routes in the Robinson-Schensted algorithm applied to large random sequences, showing convergence to a deterministic curve depending on the inserted value.

Contribution

It extends previous work by proving a limit shape theorem for bumping routes, answering a question posed by Moore in 2006.

Findings

Bumping routes converge to an explicit deterministic curve.

The limit shape depends only on the inserted value .

The result generalizes the asymptotic determinism of Robinson-Schensted insertion.

Abstract

We prove a limit shape theorem describing the asymptotic shape of bumping routes when the Robinson-Schensted algorithm is applied to a finite sequence of independent, identically distributed random variables with the uniform distribution $U[0,1]$ on the unit interval, followed by an insertion of a deterministic number $\alpha$. The bumping route converges after scaling, in the limit as the length of the sequence tends to infinity, to an explicit, deterministic curve depending only on $\alpha$. This extends our previous result on the asymptotic determinism of Robinson-Schensted insertion, and answers a question posed by Moore in 2006.