Efficient recursions for general factorisable models

DOI10.1093/BIOMET/91.3.751MaRDI QIDQ3429976zbMATH OpenOpenAlexFDO

Authors

Publication date 20 March 2007

Published in Biometrika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/biomet/91.3.751

zbMATH Keywords

Markov chain Monte CarloIsing modelGibbs distributionPartition functionAutologistic distributionNormalising constant

Mathematics Subject Classification ID

Random fields; image analysis (62M40) Characterization and structure theory of statistical distributions (62E10)

Recommendations

• Recursive computing and simulation-free inference for general factorizable models
• Recursions on the marginals and exact computation of the normalizing constant for Gibbs processes
• Efficient Calculation of the Normalizing Constant of the Autologistic and Related Models on the Cylinder and Lattice
• Exact marginals and normalizing constant for Gibbs distributions
• Compositional models, Bayesian models and recursive factorization models.

Cited in

(24)

• Marginal Likelihood Estimation via Power Posteriors
• Scalable Bayesian inference for the inverse temperature of a hidden Potts model
• Recursions on the marginals and exact computation of the normalizing constant for Gibbs processes
• A centered bivariate spatial regression model for binary data with an application to presettlement vegetation data in the midwestern United States
• Sample-based maximum likelihood estimation of the autologistic model
• The value of information in spatial decision making
• Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels
• Spatial hidden Markov models and species distributions
• Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
• Efficient Enumeration of Distinct Factors Using Package Representations
• A method for bias-reduction of sample-based MLE of the autologistic model
• A synthetic likelihood approach for intractable Markov random fields
• An adjustment for edge effects using an augmented neighborhood model in the spatial auto-logistic model
• Recursive computing and simulation-free inference for general factorizable models
• Bayesian Model Selection for Exponential Random Graph Models via Adjusted Pseudolikelihoods
• Dynamic decision making for graphical models applied to oil exploration
• Hidden Gibbs random fields model selection using block likelihood information criterion
• A Novel Approach for Markov Random Field With Intractable Normalizing Constant on Large Lattices
• Efficient Calculation of the Normalizing Constant of the Autologistic and Related Models on the Cylinder and Lattice
• Approximate computations for binary Markov random fields and their use in Bayesian models
• Exact marginals and normalizing constant for Gibbs distributions
• Analysis of clustered spatially correlated binary data using autologistic model and Bayesian method with an application to dental caries of 3--5-year-old children
• Adaptive ABC model choice and geometric summary statistics for hidden Gibbs random fields
• Approximate posterior distributions for convolutional two-level hidden Markov models

This page was built for publication: Efficient recursions for general factorisable models

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