Poisson limit of bumping routes in the Robinson-Schensted correspondence
From MaRDI portal
Publication:2067665
Abstract: We consider the Robinson-Schensted-Knuth algorithm applied to a random input and investigate the shape of the bumping route (in the vicinity of the -axis) when a specified number is inserted into a large Plancherel-distributed tableau. We show that after a projective change of the coordinate system the bumping route converges in distribution to the Poisson process.
Recommendations
- Limit shapes of bumping routes in the Robinson-Schensted correspondence
- Poisson limit theorems for the Robinson-Schensted correspondence and for the multi-line Hammersley process
- Robinson-Schensted-Knuth algorithm, jeu de taquin, and Kerov-Vershik measures on infinite tableaux
- Decorated Young tableaux and the poissonized Robinson-Schensted process
- A path-transformation for random walks and the Robinson-Schensted correspondence
Cites work
- An extension of Schensted's theorem
- Estimate of time needed for a coordinate of a Bernoulli scheme to fall into the first column of a Young tableau
- scientific article; zbMATH DE number 1001729 (Why is no real title available?)
- scientific article; zbMATH DE number 1303717 (Why is no real title available?)
- scientific article; zbMATH DE number 1549030 (Why is no real title available?)
- scientific article; zbMATH DE number 227027 (Why is no real title available?)
- Hydrodynamic limit of the Robinson–Schensted–Knuth algorithm
- Jeu de taquin dynamics on infinite Young tableaux and second class particles
- Large deviations for increasing sequences on the plane
- Limit shapes of bumping routes in the Robinson-Schensted correspondence
- On Increasing Subsequences of I.I.D. Samples
- Probability. Theory and examples.
- Quelques remarques sur une Construction de Schensted.
- The surprising mathematics of longest increasing subsequences
Cited in
(7)- Poisson limit theorems for the Robinson-Schensted correspondence and for the multi-line Hammersley process
- Robinson-Schensted-Knuth algorithm, jeu de taquin, and Kerov-Vershik measures on infinite tableaux
- Limit shapes of bumping routes in the Robinson-Schensted correspondence
- Hydrodynamic limit of the Robinson–Schensted–Knuth algorithm
- Decorated Young tableaux and the poissonized Robinson-Schensted process
- Fluctuations of Schensted row insertion
- The number of steps in the Robinson-Schensted algorithm
This page was built for publication: Poisson limit of bumping routes in the Robinson-Schensted correspondence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2067665)