Abstract
Abstract In this partly expository paper a simple random walk model is introduced for generating sequences of ordered elements. The model is related to Polya's urn scheme. An alternative description of the walk leads to conditionally independent steps. A basic theorem for the walk is proved and applications are given. Among other things, recursion formulas for moments of order statistics are studied and connections with exceedances and distribution-free tolerance intervals are indicated.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
