Efficient Sampling Methods for Discrete Distributions

20Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We study the fundamental problem of the exact and efficient generation of random values from a finite and discrete probability distribution. Suppose that we are given n distinct events with associated probabilities p1, ⋯ , pn. First, we consider the problem of sampling from the distribution where the i-th event has probability proportional to pi. Second, we study the problem of sampling a subset which includes the i-th event independently with probability pi. For both problems we present on two different classes of inputs—sorted and general probabilities—efficient data structures consisting of a preprocessing and a query algorithm. Varying the allotted preprocessing time yields a trade-off between preprocessing and query time, which we prove to be asymptotically optimal everywhere.

Cite

CITATION STYLE

APA

Bringmann, K., & Panagiotou, K. (2017). Efficient Sampling Methods for Discrete Distributions. Algorithmica, 79(2), 484–508. https://doi.org/10.1007/s00453-016-0205-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free