Polynomial-time algorithm recovers the conditional-independence graph of a d-sparse GGM from one Glauber trajectory with length independent of mixing time.
Frontiers in aging neuroscience , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Learning Gaussian Graphical Models from a Glauber Trajectory Without Mixing
Polynomial-time algorithm recovers the conditional-independence graph of a d-sparse GGM from one Glauber trajectory with length independent of mixing time.