Probabilities for a k-th nearest neighbor problem on the line

DOI10.1214/AOP/1176997037zbMATH Open0263.60005OpenAlexW2021079466MaRDI QIDQ2561424FDOQ2561424

Authors: Sylvan Wallenstein, Joseph Naus 

Publication date: 1973

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1176997037

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Geometric probability and stochastic geometry (60D05)

Cited In (4)

• Multiplicity adjustment for temporal and spatial scan statistics using Markov property
• Distribution of the minimum number of points in a scanning interval on the line
• On some significance tests in cluster analysis
• The number of dense arrangements

This page was built for publication: Probabilities for a \(k\)-th nearest neighbor problem on the line

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