A path-transformation for random walks and the Robinson-Schensted correspondence

Simple item page
dc.creatorO'Connell, Neil
dc.date2002-03-18
dc.date2002-09-26
dc.date.accessioned2026-07-07T09:32:31Z
dc.date.available2026-07-07T09:32:31Z
dc.descriptionIn [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.
dc.identifierhttps://arxiv.org/abs/math/0203177
dc.identifierhttp://arxiv.org/abs/math/0203177
dc.identifierTrans. Amer. Math. Soc. 355 (2003) 3669--3697.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158803
dc.subjectProbability
dc.subjectCombinatorics
dc.subjectRepresentation Theory
dc.subject60H25;60K35;60K25;05E10;68R15;60J45
dc.titleA path-transformation for random walks and the Robinson-Schensted correspondence
dc.typetext

Files

Collections

arXiv