A central limit theorem for the sock-sorting problem

MaRDI QIDQ4387147zbMATH OpenFDO

Authors Wenbo V. Li, Geoffrey Pritchard

Publication date 14 March 1999

zbMATH Keywords

Brownian sheetfunctional central limit theoremlimiting Gaussian process

Mathematics Subject Classification ID

Functional limit theorems; invariance principles (60F17)

Recommendations

• Random time changes for sock-sorting and other stochastic process limit theorems
• A brief overview of the sock matching problem.
• A path formula for the sock sorting problem
• The Sock Problem Revisited

Cited in

(6)

• Fluctuation bounds for sock-sorting and other stochastic processes
• Random time changes for sock-sorting and other stochastic process limit theorems
• The Sock Problem Revisited
• A path formula for the sock sorting problem
• Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence
• An analysis of the last round matching problem

This page was built for publication: A central limit theorem for the sock-sorting problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4387147)