Generic identifiability conjecture for all non-complete graph families
Statement
Let be any family of non-complete graphs, and let denote the homoscedastic linear structural equation model associated with . Generic identifiability conjecture. The graph parameter of the family 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.