Recursive computation of inclusion probabilities in ranked-set sampling

DOI10.1016/J.JSPI.2011.05.017zbMath1221.62017OpenAlexW1994041416MaRDI QIDQ2276195

Jesse C. Frey

Publication date: 1 August 2011

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jspi.2011.05.017

zbMATH Keywords

finite populationHorvitz-Thompson estimatorlevel 0 samplinglevel 1 samplinglevel 2 sampling

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05)

Related Items (11)

Inclusion probabilities in partially rank ordered set sampling ⋮ Rescaling bootstrap technique for variance estimation for ranked set samples in finite population ⋮ Design-based estimators of the distribution function in ranked set sampling with an application ⋮ Information theory approach to ranked set sampling and new sub-ratio estimators ⋮ Ranked set sampling: its relevance and impact on statistical inference ⋮ Constructing quantile confidence intervals using extended simple random sample in finite populations ⋮ Two-stage cluster samples with ranked set sampling designs ⋮ Estimation of population mean and total in a finite population setting using multiple auxiliary variables ⋮ Unnamed Item ⋮ Ratio estimators based on a ranked set sample in a finite population setting ⋮ Estimation of a finite population mean and total using population ranks of sample units

Cites Work

• Finite population corrections for ranked set sampling
• A note on inclusion probability in ranked set sampling and some of its variations
• A New Formula for Inclusion Probabilities in Median-Ranked Set Sampling
• Inferences on the Correlation Coefficient in Bivariate Normal Populations From Ranked Set Samples
• A Generalization of Sampling Without Replacement From a Finite Universe
• Unnamed Item
• Unnamed Item

This page was built for publication: Recursive computation of inclusion probabilities in ranked-set sampling