Discrete Spacings

Details Discrete Spacings Discrete Spacings

2001-12-06

arxiv.org/abs/math/0112056v1

Mathematics

Probability

14 pages

Scientific paper

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring units have length less than $k$. When centered and scaled by $n^{-1/2}$ the resulting numbers of spacings of length $1, 2,..., k-1$ have simultaneously a limiting normal distribution as $n\to\infty$. This is proved by the classical method of moments.

Affiliated with

Also associated with

No associations

Rating

Discrete Spacings 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 Discrete Spacings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Discrete Spacings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-372458