Sampling Algorithms for Discrete Markov Random Fields and Related Graphical Models
From MaRDI portal
Publication:5881990
DOI10.1080/01621459.2021.1898410OpenAlexW3135335391MaRDI QIDQ5881990
Publication date: 14 March 2023
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01621459.2021.1898410
Ising modelPotts modelMetropolis algorithmcellular Potts modelSwendsen-Wang algorithmWolff algorithm
Random fields; image analysis (62M40) Probabilistic graphical models (62H22) Statistical mechanics, structure of matter (82-XX) Statistical sampling theory and related topics (62Dxx)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A short history of Markov chain Monte Carlo: Subjective recollections from incomplete data
- Estimating heterogeneous graphical models for discrete data with an application to roll call voting
- J. R. Wolf and the Zürich sunspot relative numbers
- Limit theorems for the empirical vector of the Curie-Weiss-Potts model
- Markov fields and log-linear interaction models for contingency tables
- Fault tolerant cellular spaces
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Improving the realism of the cellular Potts model in simulations of biological cells
- The Swendsen-Wang process does not always mix rapidly
- Dengue fever spreading based on probabilistic cellular automata with two lattices
- Probabilistic cellular automata. Theory, applications and future perspectives
- Comparison of Swendsen-Wang and heat-bath dynamics
- The Evolution of Markov Chain Monte Carlo Methods
- An Introduction to Conditional Random Fields
- Statistical mechanics, three-dimensionality and NP-completeness
- Information Theory and Statistical Mechanics
- Classification method for disease risk mapping based on discrete hidden Markov random fields
- Sampling-Based Approaches to Calculating Marginal Densities
- Probability on Graphs
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Auxiliary Variable Methods for Markov Chain Monte Carlo with Applications
- Probabilistic Networks and Expert Systems
- Rate of convergence of the Swendsen-Wang dynamics in image segmentation problems: a theoretical and experimental study
- Bayesian Inference in the Presence of Intractable Normalizing Functions
- Log-determinant relaxation for approximate inference in discrete Markov random fields
- Exponentially slow mixing in the mean-field Swendsen-Wang dynamics
- Regeneration in Markov Chain Samplers
- Automated Redistricting Simulation Using Markov Chain Monte Carlo
- Beitrag zur Theorie des Ferromagnetismus
- Equation of State Calculations by Fast Computing Machines
- Dynamics for the mean-field random-cluster model
- Swendsen-Wang Algorithm on the Mean-Field Potts Model
- Monte Carlo sampling methods using Markov chains and their applications
- Markov Random Fields and Gibbs Ensembles
- On Ising's model of ferromagnetism
- The Monte Carlo Method
- Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
- Random forests
This page was built for publication: Sampling Algorithms for Discrete Markov Random Fields and Related Graphical Models