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

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

2007-01-10

arxiv.org/abs/math/0701288v1

Mathematics

Probability

31 PAGES

Scientific paper

We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a string of 0's, and then evolves by changing each 0 to 1, with then changes done in random order. What is the maximal number of runs of 1's? We give asymptotic results for the distribution and mean. It turns out that, as in many problems involving a maximum, the maximum is asymptotically normal, with fluctuations of order n^{1/2}, and to the first order well approximated by the number of runs at the instance when the expectation is maximized, in this case when half the elements have changed to 1; there is also a second order term of order n^{1/3}. We also treat some variations, including priority queues. The proofs use methods originally developed for random graphs.

Affiliated with

Also associated with

No associations

Rating

Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-448147