1 problem

Matching

Lauritzen's score matching estimability conjecture
At least 11 years old
Lauritzen's conjecture. The graph $G$ is $n$ -estimable if and only if
opencombinatorics graphical-models score-matching
011

Lauritzen's score matching estimability conjecture