Skip to main content

A Central Limit Theorem for the Sock-Sorting Problem

  • Conference paper

Part of the book series: Progress in Probability ((PRPR,volume 43))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Billingsley, Convergence of probability measures Wiley, New York, 1968.

    MATH  Google Scholar 

  2. Csörgo, Strong approximations of the Hoeffding, Blum, Kiefer, Rosenblatt multivariate empirical process, J. Multivariate Analysis 9 (1979), 84–100.

    Article  Google Scholar 

  3. P. Deheuvels and D. Mason, Bahadur-Kiefer-type processes, Ann. Prob. 18 (1990), 669–697.

    Article  MathSciNet  MATH  Google Scholar 

  4. R. Durrett, Probability: Theory and examples 1st ed., Wadsworth, Pacific Grove, California, 1991.

    MATH  Google Scholar 

  5. M. P. Eisner, Problem 216, College Mathematics Journal 13 (1982), 206.

    Google Scholar 

  6. D. M. Friedlen, Problem E3265, Amer. Math. Monthly 97 (1990), 242–244.

    Article  MathSciNet  Google Scholar 

  7. S. Ethier and T. Kurtz, Markov processes: characterization and convergence Wiley, New York, 1986.

    MATH  Google Scholar 

  8. R. Luttmann, Problem E3148, Amer. Math. Monthly 95 (1988), 357–358.

    Article  MathSciNet  Google Scholar 

  9. E. Giné and J. Zinn, Some limit theorems for empirical processes, Ann. Prob. 12 (1984), 929–989.

    Article  MATH  Google Scholar 

  10. S. Rabinowitz Index to Mathematical Problems 1980–1984, MathPro Press, Westford, MA, 1992.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Basel AG

About this paper

Cite this paper

Li, W.V., Pritchard, G. (1998). A Central Limit Theorem for the Sock-Sorting Problem. In: Eberlein, E., Hahn, M., Talagrand, M. (eds) High Dimensional Probability. Progress in Probability, vol 43. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8829-5_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-8829-5_14

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9790-7

  • Online ISBN: 978-3-0348-8829-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics