scientific article; zbMATH DE number 5247142

zbMATH Open1136.62008arXivmath/0610233MaRDI QIDQ5449205FDOQ5449205

Authors: Sergi Elizalde, Kevin M. Woods 

Publication date: 11 March 2008

Full work available at URL: https://arxiv.org/abs/math/0610233

Title of this publication is not available (Why is that?)

Recommendations

• A tighter bound for graphical models
• Inference in a class of directed random graph models with an increasing number of parameters
• Combinatorial inference for graphical models
• scientific article; zbMATH DE number 2189929
• Approximate counting, the Lovász local lemma, and inference in graphical models
• Approximate counting, the Lovász local lemma, and inference in graphical models
• On computational complexity of graph inference from counting
• Approximate inference in Bayesian networks: parameterized complexity results
• Bayesian Inference for Gaussian Graphical Models Beyond Decomposable Graphs

zbMATH Keywords

graphical modelshidden Markov modelspolytopesinference functions

Mathematics Subject Classification ID

Applications of graph theory (05C90) Foundations and philosophical topics in statistics (62A01)

Cited In (3)

• Title not available (Why is that?)
• The probability of choosing primitive sets
• Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449205)