The probability of Simpson conversion in four-dimensional binary tables

From papers

Let pijkp_{ijk\ell} be entries of a 2×2×2×22\times2\times2\times2 table sampled uniformly from the probability simplex, with i,j,k,{0,1}i,j,k,\ell\in\{0,1\} and pijk0p_{ijk\ell}\geq0. Consider the two 2×2×22\times2\times2 subtables obtained by fixing =0\ell=0 and =1\ell=1, and their sum over \ell. A Simpson conversion occurs when the two subtables induce the same triangulation of the cube, while their sum induces a different triangulation. The probability conjecture. The probability that a Simpson conversion occurs in this context is 1/4501/450. This is based on computational sampling and is presented as a conjecture about the frequency of Simpson conversions in 2×2×2×22\times2\times2\times2 contingency tables; the corresponding two-dimensional probability is known to be 1/601/60.

Progress summary

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

Sources & referencesView supporting material

Primary source

Svante Linusson and Matthew T. Stamps, “Association and Simpson conversion in 2 2 2 contingency tables”, arXiv:1809.04633 (2021).

Solutions 0

No solutions have been posted yet.