ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XX be a transient partially exchangeable process taking values in a countable set SS with non-random initial state X0X_0. Its transition numbers are

M=(M(u,v))u,v∈S=(#{i≥0:(Xi,Xi+1)=(u,v)})u,v∈S.M=(M(u,v))_{u,v\in S}=\left(\#\{i\geq 0:(X_i,X_{i+1})=(u,v)\}\right)_{u,v\in S}.

Diaconis–Freedman conjecture. The partially exchangeable σ\sigma-algebra of XX is generated up to null sets by the transition numbers MM.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.