Boltzmann Sampling for Powersets without an Oracle
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914276614078464 |
|---|---|
| author | Peyen, Jean |
| author_facet | Peyen, Jean |
| contents | We show that powersets over structures with a bounded counting sequence can be sampled efficiently without evaluating the generating function. An algorithm is provided, implemented, and tested. Runtimes are comparable to existing Boltzmann samplers reported in the literature. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_09508 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Boltzmann Sampling for Powersets without an Oracle Peyen, Jean Discrete Mathematics Data Structures and Algorithms Combinatorics Probability We show that powersets over structures with a bounded counting sequence can be sampled efficiently without evaluating the generating function. An algorithm is provided, implemented, and tested. Runtimes are comparable to existing Boltzmann samplers reported in the literature. |
| title | Boltzmann Sampling for Powersets without an Oracle |
| topic | Discrete Mathematics Data Structures and Algorithms Combinatorics Probability |
| url | https://arxiv.org/abs/2601.09508 |