In article <[EMAIL PROTECTED]>, Konrad Den Ende <[EMAIL PROTECTED]> wrote: >We've created a vector with random numbers and took a look at the number of >raising sequences in it. Normally, one would expect to get about 1/2 of all >the sequences occured to be of length 1, about 1/4 of length 2, about 1/8 of >length 3 and so on. >Everything works as expected except for the sequences of length 2. No matter >how much we grunt at the machine, it always gets to few of those. All the >others are about the right size, though. >Anybody who'd like to contribute and shed some light at this phenomenon?
I am not clear what your definition of "raising sequence" is, nor how you have created the vector with random numbers. If the vector is a vector of sums, with the numbers being symmetric about 0, your statement would be correct. But if your vector is a vector of random numbers, it is not, and I would need a precise statement to decide what the probabilities should be. -- This address is for information only. I do not claim that these views are those of the Statistics Department or of Purdue University. Herman Rubin, Department of Statistics, Purdue University [EMAIL PROTECTED] Phone: (765)494-6054 FAX: (765)494-0558 . . ================================================================= Instructions for joining and leaving this list, remarks about the problem of INAPPROPRIATE MESSAGES, and archives are available at: . http://jse.stat.ncsu.edu/ . =================================================================
