Discrete Spacings

DOI10.1111/1467-9574.00240MaRDI QIDQ4469587zbMATHOpenAlexFDO

Authors Chris A. J. Klaassen, J. Th. Runnenburg

Publication date 15 June 2004

Published in Statistica Neerlandica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0112056

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05)

Abstract: 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,\mathrm{...},k-1$ have simultaneously a limiting normal distribution as $noinfty$. This is proved by the classical method of moments.

Recommendations

• Asymptotic distribution of sample spacings lengths
• scientific article; zbMATH DE number 589989
• scientific article; zbMATH DE number 3913338
• On a problem concerning spacings
• Limit theorems and random spacings related to cutting of DNAs by radiation

Cites work

• scientific article; zbMATH DE number 3232159 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• A fixed point theorem for distributions
• Interval packing: the vacant interval distribution.

Cited in

(6)

• A combinatorial approach for discrete car parking on random labelled trees
• Limit theorems and random spacings related to cutting of DNAs by radiation
• scientific article; zbMATH DE number 3913338 (Why is no real title available?)
• Per-site occupancy in the discrete parking problem
• Random unfriendly seating arrangement in a dining table
• The Page-Rényi parking process

This page was built for publication: Discrete Spacings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4469587)