Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.

ABC likelihood-free methods for model choice in Gibbs random fields

Open access

Abstract

Gibbs random fields (GRF) are polymorphous statistical models that can be used to analyse different types of dependence, in particular for spatially correlated data. However, when those models are faced with the challenge of selecting a dependence structure from many, the use of standard model choice methods is hampered by the unavailability of the normalising constant in the Gibbs likelihood. In particular, from a Bayesian perspective, the computation of the posterior probabilities of the models under competition requires special likelihood-free simulation techniques like the Approximate Bayesian Computation (ABC) algorithm that is intensively used in population genetics. We show in this paper how to implement an ABC algorithm geared towards model choice in the general setting of Gibbs random fields, demonstrating in particular that there exists a sufficient statistic across models. The accuracy of the approximation to the posterior probabilities can be further improved by importance sampling on the distribution of the models. The practical aspects of the method are detailed through two applications, the test of an iid Bernoulli model versus a first-order Markov chain, and the choice of a folding structure for two proteins.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1214/09-ba412

Cites

22 of 22 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 1

  1. Häggström, O. (2002). Finite Markov Chains and Algorithmic Applications, volume 52, Student Texts. London Mathematical Society. · doi:10.1017/cbo9780511613586

Cited by

See all 119

Metadata

Authors
Grelaud, A., Marin, J.-M., Robert, C. P., Rodolphe, F., & Taly, J.-F.
Affiliations
  • Centre de Recherche en Mathématiques de la Décision (FR)
  • Institut Montpelliérain Alexander Grothendieck (FR)
  • Institut National de la Statistique et des Etudes Economiques (FR)
  • Institut National de la Recherche Agronomique (FR)
Venue
Bayesian Analysis
Published
2009-06-01
Volume
4
Issue
2
Pages
317-335
ISSN
  • 1931-6690 (ISSN-L)
  • 1936-0975
OpenAlex
W2166215379
Cited by
119
References
22
Citations by year
2026: 1 · 2025: 5 · 2024: 4 · 2022: 4 · 2021: 6 · 2020: 8 · 2019: 7 · 2018: 11 · 2017: 3 · 2016: 7 · 2015: 11 · 2014: 13 · 2013: 8 · 2012: 6
FWCI
8.58
Type
journal article
Language
en
Open access
Licence
cc-by
Locations
  • Bayesian Analysis (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • Base Institutionnelle de Recherche de l'université Paris-Dauphine (BIRD) (University Paris-Dauphine) (submittedVersion)
  • Project Euclid (Cornell University) (submittedVersion)
  • HAL (submittedVersion, other-oa)
  • arXiv (Cornell University)
Funders
Agence Nationale de la Recherche (ANR-05-BLAN-0196, ANR-05)
Topics
  • Physical Sciences › Mathematics › Statistics and Probability › Markov Chains and Monte Carlo Methods
  • Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Bayesian Inference
  • Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
Keywords
Gibbs random fields, model selection, approximate Bayesian computation, simulation-based inference, normalizing constants, posterior model probabilities, sufficient statistics, importance sampling, spatially correlated data, Markov chains, protein folding, Bernoulli model

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.