ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G\mathcal{G} be any family of non-complete graphs, and let MGM_G denote the homoscedastic linear structural equation model associated with G∈GG\in\mathcal{G}. Generic identifiability conjecture. The graph parameter GG of the family {MG}G∈G\{M_G\}_{G\in\mathcal{G}} is generically identifiable. The claim would extend the paper's established identifiability results from particular graph families to every family of non-complete graphs. It is stated without a proof or resolution.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.