4 problems

Let $G$ be a forest on vertex set $V=\\{1,\ldots,d\\}$, with each connected component a tree having at least three nodes, and let $A$ be its adjacency matrix. Let $\mathcal{V}_G$ b…

Let $G=(V,E)$ be a graph with vertex set $V=\\{1,\ldots,d\\}$ and adjacency matrix $A$. Let $S^r(\mathbb{R}^d)$ denote the space of symmetric order-$r$ tensors, and let…

Let $\textbf{B}^N$ denote the kurtosis matrices used by MFOBI and TFOBI, tensor-valued extensions of FOBI for matrix- and tensor-valued observations. Standard ICA methods include p…

Cardoso's separation hypothesis. The solution of the ISA problem can be separated into (i) applying traditional ICA and then (ii) clustering the ICA elements into statistically dep…