Recursions on the marginals and exact computation of the normalizing constant for Gibbs processes

DOI10.1007/s00180-014-0510-5zbMath1306.65065OpenAlexW1974452402MaRDI QIDQ2259812

Cécile Hardouin, Xavier Guyon

Publication date: 5 March 2015

Published in: Computational Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00180-014-0510-5

zbMATH Keywords

Gibbs distributionnormalizing constantmarginal laws

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Random fields; image analysis (62M40) Numerical analysis or methods applied to Markov chains (65C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Spatial statistics and modeling. Translated from the French by Kevin Bleakley.
• Approximation algorithms for the normalizing constant of Gibbs distributions
• Randomized algorithms for low-rank matrix factorizations: sharp performance bounds
• Markov Random Fields and Their Applications
• Efficient recursions for general factorisable models
• A recursive algorithm for Markov random fields
• Efficient Calculation of the Normalizing Constant of the Autologistic and Related Models on the Cylinder and Lattice
• Recursive computing and simulation-free inference for general factorizable models
• An efficient Markov chain Monte Carlo method for distributions with intractable normalising constants
• Monte Carlo strategies in scientific computing

This page was built for publication: Recursions on the marginals and exact computation of the normalizing constant for Gibbs processes