Random time changes for sock-sorting and other stochastic process limit theorems

DOI10.1214/EJP.v4-51zbMath0929.60023MaRDI QIDQ1298339

David Steinsaltz

Publication date: 22 August 1999

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/120086

zbMATH Keywords

sortingrandomizationfunctional limit theoremtime changemaximal inequalitiesPoissonizationrandom allocations

Mathematics Subject Classification ID

Extreme value theory; extremal stochastic processes (60G70) Functional limit theorems; invariance principles (60F17) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (3)

A Path Formula for the Sock Sorting Problem ⋮ Interval graph limits ⋮ Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence

This page was built for publication: Random time changes for sock-sorting and other stochastic process limit theorems