7 problems

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…

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

Model-containment conjecture. Even though the two models are different, the model obtained from $G$ is always contained in the one obtained from $G'$.

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 $G_1=(V,D_1)$ and $G_2=(D,V_2)$ be non-complete simple directed graphs with the same out-degree sequence but different strongly connected components. For $k\in\{1,2\}$, let…

The paper considers simple directed graphs, their out-degree sequences, strongly connected components, and parentally closed sets. For a graph $G_k$, write $\operatorname{ch}_k(i)$…

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…