Discrete Spacings
| dc.creator | Klaassen, Chris A. J. | |
| dc.creator | Runnenburg, J. Theo | |
| dc.date | 2001-12-06 | |
| dc.date.accessioned | 2026-07-07T04:45:03Z | |
| dc.date.available | 2026-07-07T04:45:03Z | |
| dc.description | 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. | |
| dc.description | 14 pages | |
| dc.identifier | https://arxiv.org/abs/math/0112056 | |
| dc.identifier | http://arxiv.org/abs/math/0112056 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/62831 | |
| dc.subject | Probability | |
| dc.subject | Classical Analysis and ODEs | |
| dc.subject | 60F05 | |
| dc.title | Discrete Spacings | |
| dc.type | text |