Abstract

AbstractWe investigate the evolution in time of the position of a fixed number in the insertion tableau when the Robinson–Schensted–Knuth algorithm is applied to a sequence of random numbers. When the length of the sequence tends to infinity, a typical trajectory after scaling converges uniformly in probability to some deterministic curve.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call