2000 character limit reached
de Finetti reductions for partially exchangeable probability distributions
Published 16 Jan 2018 in math.PR, cs.IT, math.CO, math.IT, and quant-ph | (1801.05240v1)
Abstract: We introduce a general framework for de Finetti reduction results, applicable to various notions of partially exchangeable probability distributions. Explicit statements are derived for the cases of exchangeability, Markov exchangeability, and some generalizations of these. Our techniques are combinatorial and rely on the "BEST" theorem, enumerating the Eulerian cycles of a multigraph.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.