A Central Limit Theorem for the Sock-Sorting Problem
Wenbo V. Li, Geoffrey Pritchard · Birkhäuser Basel eBooks · 1998
The problem of arranging 2n objects into n pairs in a prescribed way, when the objects are presented one at a time in random order, is considered. Using tools from the theory of empirical processes, we derive a functional central limit theorem, with a limiting Gaussian process closely related to the Brownian sheet. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.