The probabilistic determinant formula for the delta process

Let D[k1]D\subseteq[k-1], and let MDM^D be the matrix defined in the paper from the delta-process indicator variables. Let P ⁣det(MD)\mathbb{P}\!\det(M^D) denote its probabilistic determinant, let Rp,r\mathcal{R}_{\textbf{p},r} and Sp,r\mathcal{S}_{\textbf{p},r} be the corresponding sets of tuples, and choose S\textbf{S} uniformly from Rp,r\mathcal{R}_{\textbf{p},r}.

The probabilistic determinant formula. For every D[k1]D\subseteq[k-1],

P ⁣det(MD)=Rp,rSp,r×P(kS1, DS1SRp,r).\mathbb{P}\!\det(M^D)=\frac{|\mathcal{R}_{\textbf{p},r}|}{|\mathcal{S}_{\textbf{p},r}|}\times\mathbb{P}\bigl(k\notin S_1,\ D\subseteq S_1\mid \textbf{S}\in\mathcal{R}_{\textbf{p},r}\bigr).

The paper presents this as a formula suggested by calculations and as a possible route toward proving the preceding delta-process tree probability conjecture; no proof is given.

Sources & referencesView supporting material

Primary source

Olivier Bernardi and Alejandro H. Morales, “Some probabilistic trees with algebraic roots”, arXiv:1501.01135 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.