A path-transformation for random walks and the Robinson-Schensted   correspondence
  In [O'Connell and Yor (2002)] a path-transformation G was introduced with the property that, for X belonging to a certain class of random walks on the integer lattice, the transformed walk G(X) has the same law as that of the original walk conditioned never to exit a type-A Weyl chamber. In this paper, we show that G is closely related to the Robinson-Schensted algorithm, and use this connection to give a new proof of the above representation theorem. The new proof is valid for a larger class of random walks and yields additional information about the joint law of X and G(X). The corresponding results for the Brownian model are recovered by Donsker's theorem. These are connected with Hermitian Brownian motion and the Gaussian Unitary Ensemble of random matrix theory. The connection we make between the path-transformation G and the RS algorithm also provides a new formula and interpretation for the latter. This can be used to study properties of the RS algorithm and, moreover, extends easily to a continuous setting. 
Neil O'Connell