Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Karp-Luby sampling #59

Open
make-github-pseudonymous-again opened this issue Oct 2, 2020 · 0 comments
Open

Karp-Luby sampling #59

make-github-pseudonymous-again opened this issue Oct 2, 2020 · 0 comments

Comments

@make-github-pseudonymous-again
Copy link
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
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant