Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence

Annals of Combinatorics

Volumn 12, Issue 4, 2009, Pages 417-447

  Janson, Svante ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

Brownian motion; Evolution of random strings; Priority queues; Runs; Sock sorting; Sorting algorithm

Indexed keywords

EID: 63749131138     PISSN: 02180006     EISSN: 02193094     Source Type: Journal    
DOI: 10.1007/s00026-009-0007-z     Document Type: Article

References (25)

1. G. af Hällström 1952 Ein lineares Inselproblem der kombinatorischen Wahr-schein-lich-keitsrech- nung, Ann Acad. Sci. Fennicae. Ser. A. I. Math.-Phys. 1952 123 9
2. A.D. Barbour 1975 A note on the maximum size of a closed epidemic J. R. Stat. Soc. Ser. B 37 3 459 460
3. A.D. Barbour 1981 Brownian motion and a sharply curved boundary Adv. in Appl. Probab. 13 4 736 750
4. Billingsley P.: Convergence of Probability Measures. John Wiley & Sons, New York- London-Sydney (1968)
5. H.E. Daniels 1974 The maximum size of a closed epidemic Adv. in Appl. Probab. 6 607 621
6. H.E. Daniels 1989 The maximum of a Gaussian process whose mean path has a maximum, with an application to the strength of bundles of fibres Adv. in Appl. Probab. 21 2 315 333
7. H.E. Daniels T.H.R. Skyrme 1985 The maximum of a random walk whose mean path has a maximum Adv. in Appl. Probab. 17 1 85 99
8. P. Flajolet J. Françon J. Vuillemin 1980 Sequence of operations analysis for dynamic data structures J. Algorithms 1 2 111 141
9. P. Flajolet C. Puech J. Vuillemin 1986 The analysis of simple list structures Inform. Sci. 38 2 121 146
10. P. Groeneboom 1989 Brownian motion with a parabolic drift and Airy functions Probab. Theory Related Fields 81 1 79 109
11. Gut A.: Probability: A Graduate Course. Springer, New York (2005)
12. Jacod J., Shiryaev A.N.: Limit Theorems for Stochastic Processes. Springer-Verlag, Berlin (1987)
13. S. Janson 1990 A functional limit theorem for random graphs with applications to subgraph count statistics Random Structures Algorithms 1 1 15 37
14. S. Janson 1994 Orthogonal decompositions and dunctional limit theorems for random graph statistics Mem. Amer. Math. Soc. 111 534 vi+78
15. S. Janson 2004 Functional limit theorems for multitype branching processes and generalized Ṕolya urns Stochastic Process. Appl. 110 2 177 245
16. Kallenberg O.: Foundations of Modern Probability, 2nd Ed. New York, Springer-Verlag (2002)
17. C.M. Kenyon J.S. Vitter 1991 Maximum queue size and hashing with lazy deletion Algorithmica 6 4 597 619
18. W.V. Li and G. Pritchard, A central limit theorem for the sock-sorting problem, In: High Dimensional Probability, Progr. Probab., Vol. 43, Birkhäuser, Basel, (1998) pp. 245-248.
19. G. Louchard 1987 Random walks, Gaussian processes and list structures, Theoret Comput. Sci. 53 1 99 124
20. G. Louchard 1988 Large finite population queueing systems part I: the infinite server model Comm. Statist. Stochastic Models 4 3 473 505
21. G. Louchard C. Kenyon R. Schott 1997 Data structures' maxima SIAM J. Comput. 26 4 1006 1042
22. A.M. Mood 1940 The distribution theory of runs Ann. Math. Statistics 11 367 392
23. D. Steinsaltz, Random time changes for sock-sorting and other stochastic process limit theorems, Electron. J. Probab. 4 (1999) paper 14.
24. W.L. Stevens 1939 Distribution of groups in a sequence of alternatives Annals of Eugenics 9 10 17
25. C.J. Van Wyk J.S. Vitter 1986 The complexity of hashing with lazy deletion Algorithmica 1 17 29