Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.01176 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910980018012160 |
|---|---|
| author | Dordzhiev, Adyan |
| author_facet | Dordzhiev, Adyan |
| contents | Let $q \in (0,1)$. We formulate an asymptotic version of the $q$-analogue of de Finetti's theorem. Using the convex structure of the space of $q$-exchangeable probability measures, we show that the optimal rate of convergence is of order $q^n$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_01176 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Finite version of the $q$-analogue of de Finetti's theorem Dordzhiev, Adyan Probability Combinatorics Let $q \in (0,1)$. We formulate an asymptotic version of the $q$-analogue of de Finetti's theorem. Using the convex structure of the space of $q$-exchangeable probability measures, we show that the optimal rate of convergence is of order $q^n$. |
| title | Finite version of the $q$-analogue of de Finetti's theorem |
| topic | Probability Combinatorics |
| url | https://arxiv.org/abs/2506.01176 |