Distance between sampling with and without replacement

DOI10.1111/J.1467-9574.1978.TB01387.XMaRDI QIDQ4178321zbMATH OpenOpenAlexFDO

Authors A. J. Stam

Publication date 1978

Published in Statistica Neerlandica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1467-9574.1978.tb01387.x

zbMATH Keywords

Kullback-Leibler Information DistanceSampling DistanceSampling With ReplacementSampling Without Replacement

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05)

Cites work

• A note on the upper bound for the distance in total variation between the binomal and the Poisson distribution
• Asymptotic Theory for Successive Sampling with Varying Probabilities Without Replacement, I
• Asymptotical independence of the lengths of subintervals of a randomly partitioned interval; a sample from S. Ikeda's work
• scientific article; zbMATH DE number 3246773 (Why is no real title available?)
• scientific article; zbMATH DE number 3252891 (Why is no real title available?)
• On the Limiting Distributions of Estimates Based on Samples from Finite Universes
• On the Optimum Rate of Transmitting Information
• The inverse hypergeometric - a useful model
• Upper bounds for the distance in total variation between the binomial or negative binomial and the Poisson distribution

Cited in

(14)

• Some stochastic processes in a random permutation
• Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
• How many queries are needed to distinguish a truncated random permutation from a random function?
• A note on the chi-square method: a tool for proving cryptographic security
• Leakage resilient value comparison with application to message authentication
• The summation-truncation hybrid: reusing discarded bits for free
• The advantage of truncated permutations
• Improved security analysis for nonce-based enhanced hash-then-mask MACs
• Bounds on the information divergence for hypergeometric distributions
• Multi-user security of the sum of truncated random permutations
• A convolution inequality, yielding a sharper Berry-Esseen theorem for summands Zolotarev-close to normal
• Plinko: single-server PIR with efficient updates via invertible PRFs
• Relative entropy bounds for sampling with and without replacement
• Approximate independence of permutation mixtures

This page was built for publication: Distance between sampling with and without replacement

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