Two-color exchangeability does not imply exchangeability
Raghavendra Tripathi
TL;DR
The paper demonstrates that two-color exchangeability does not necessarily imply full exchangeability by providing simple finite examples, answering a previously open question in the field.
Contribution
It introduces explicit examples of two-color exchangeable sequences that are not exchangeable, clarifying the relationship between these concepts.
Findings
Two-color exchangeable sequences can lack full exchangeability.
Explicit finite examples of non-exchangeable two-color exchangeable sequences.
Answers an open question by Bladt and Shaiderman.
Abstract
We provide simple examples of two-color exchangeable sequences that are not exchangeable. This answers a question of Bladt and Shaiderman~\cite[Question 2.6]{bladt2019characterisation} for finite two-color exchangeable sequences.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · DNA and Biological Computing · graph theory and CDMA systems