Diaconis–Freedman conjecture for transient partially exchangeable processes
Statement
Let be a transient partially exchangeable process taking values in a countable set with non-random initial state . Its transition numbers are
Diaconis–Freedman conjecture. The partially exchangeable -algebra of is generated up to null sets by the transition numbers .
The conjecture proposes the transient counterpart of the Diaconis–Freedman theorem for partially exchangeable processes. Unlike the recurrent case, transient partially exchangeable processes need not be mixtures of Markov chains; the paper proves this conjecture.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.