Complete answer to an interval splitting problem

DOI10.1016/0167-7152(91)90092-6MaRDI QIDQ1181119zbMATH OpenOpenAlexFDO

Authors Gerold Alsmeyer

Publication date 27 June 1992

Published in Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-7152(91)90092-6

zbMATH Keywords

interval splitting problem

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Zero-one laws (60F20)

Review text

For \(n\geq 2\), let \(I_ k(n)\) denote the \(k\)-th largest interval of the \(n\) intervals generated by the splitting of \([0,1]\) through \(0,X_ 1,\dots,X_{n-1},1\), where \(X_ 1,X_ 2,\dots\) are independent uniformly distributed on \([0,1]\). The author proves that \(P(X_ n\in I_{k_ n}(n)\hbox{ i.o.})=1\) iff \(\sum_ n n^{-1}\log(n/k_ n)=\infty\).

Recommendations

• Random splittings of an interval
• On an interval splitting problem
• Random split of the interval [0,1]
• Recursive splitting of an interval when the proportions are identical and independent random variables

Cites work

• scientific article; zbMATH DE number 3620754 (Why is no real title available?)
• scientific article; zbMATH DE number 3278887 (Why is no real title available?)
• On an interval splitting problem
• On the lengths of the pieces of a stick broken at random

Cited in

(3)

• The BRS-inequality and its applications
• Random splittings of an interval
• On an interval splitting problem

This page was built for publication: Complete answer to an interval splitting problem

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