\begin{table}[th]
    \centering
    \caption{Possible combinations of Bernoulli parameters and their simplifications  when computing the distance between a connectivity matrix and a consensus matrix.}
    \label{tab:distance_cases}
    \begin{tabular}{r c c}
        \toprule
        &$\pmb{A}^t_{ij}=0$&$\pmb{A}^t_{ij}=1$\\
        \midrule
        $\pmb{C}_{ij}=0$&0&Impossible\\
        $\pmb{C}_{ij} \in ]0,1[$&$D(\mathcal{B}(0) \| \mathcal{B}(\pmb{C}_{ij}))$&$D(\mathcal{B}(1) \| \mathcal{B}(\pmb{C}_{ij}))$\\
        $\pmb{C}_{ij}=1$&Impossible&0\\
        \bottomrule
    \end{tabular}
\end{table}