Skip to content

Karp-Luby sampling #59

@make-github-pseudonymous-again

Description

@make-github-pseudonymous-again
Owner

Linear time measure approximation of a set union given oracles for uniform sampling on the multiset union and membership testing on the insertion-order labeled set union.

measure: |S| e.g. volume, cardinality, ...

set union: U_i S_i

uniform sampling on the multiset union: Sample (y, k) from U_i { (x, i) : x in S_i } uniformly at random.

membership testing on the union-order labeled set union: Test whether (y, k) belongs to U_i { (x, i) : x in S_i, x not in S_j for j < i }. Can be implemented as testing whether y belongs to { x in S_k : x not in S_j for j < k } in general.

References

  • 1983 Karp, Luby Monte-Carlo algorithms for enumeration and reliability problems
  • 1989 Karp, Luby, Madras Monte-Carlo approximation algorithms for enumeration problems

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

      Development

      No branches or pull requests

        Participants

        @make-github-pseudonymous-again

        Issue actions

          Karp-Luby sampling · Issue #59 · make-github-pseudonymous-again/js-algorithms