4 problems

General diagonal-noise representation conjecture. There exists a general adjacency matrix

Let $G_1$ and $G_2$ be complete digraphs on $p$ nodes, with all edge directions agreeing except for the edge between nodes $p-1$ and $p$. Complete-digraph edge-reversal conjecture.…

Let $\mathcal{G}$ be any family of non-complete graphs, and let $M_G$ denote the homoscedastic linear structural equation model associated with $G\in\mathcal{G}$. Generic identifia…

Let $G$ be a directed acyclic graph with node set $V$, and let $k>3$. For subsets $S_1,\ldots,S_k\subseteq V$ with … write $\mathcal{N}^{(k)}_{S_1,\ldots,S_k}$ for the subtensor of…