ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a graph with mm vertices, and let nn be the sample dimension. The graph is nn-estimable when its score matching estimator exists with probability one.

Lauritzen's conjecture. The graph GG is nn-estimable if and only if

#V+#E≤nm−(n2).\#V+\#E\leq nm-{n\choose 2}.

This conjecture proposed a purely numerical characterization of the score matching threshold. It is refuted by a graph counterexample in the paper.

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.