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

DOI10.1214/EJP.V4-51MaRDI QIDQ1298339zbMATH OpenFDO

Authors 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, http://www.emis.de/journals/EJP-ECP/EjpVol4/paper14.abs.html

zbMATH Keywords

functional limit theoremmaximal inequalitiesPoissonizationrandom allocationsrandomizationsortingtime change

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1149769
• Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence: extended abstract.
• Fluctuation bounds for sock-sorting and other stochastic processes
• Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence
• Combinatorial stochastic processes

Cited in

(6)

• Fluctuation bounds for sock-sorting and other stochastic processes
• Interval graph limits
• Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence: extended abstract.
• scientific article; zbMATH DE number 1149769 (Why is no real title available?)
• A path formula for the sock sorting problem
• 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

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