Counting the number of group orbits by marrying the Burnside process with importance sampling
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916657683759104 |
|---|---|
| author | Diaconis, Persi Zhong, Chenyang |
| author_facet | Diaconis, Persi Zhong, Chenyang |
| contents | This paper introduces a novel and general algorithm for approximately counting the number of orbits under group actions. The method is based on combining the Burnside process and importance sampling. Specializing to unitriangular groups yields an efficient algorithm for estimating the number of conjugacy classes of such groups. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_11731 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Counting the number of group orbits by marrying the Burnside process with importance sampling Diaconis, Persi Zhong, Chenyang Probability Combinatorics Group Theory Computation This paper introduces a novel and general algorithm for approximately counting the number of orbits under group actions. The method is based on combining the Burnside process and importance sampling. Specializing to unitriangular groups yields an efficient algorithm for estimating the number of conjugacy classes of such groups. |
| title | Counting the number of group orbits by marrying the Burnside process with importance sampling |
| topic | Probability Combinatorics Group Theory Computation |
| url | https://arxiv.org/abs/2501.11731 |