We use reversible jump Markov chain Monte Carlo methods (Green, 1995) to develop strategies for calculating posterior probabilities of hierarchical, graphical or decomposable log-linear models for high-dimensional contingency tables. Even for tables of moderate size, these sets of models may be very large. The choice of suitable prior distributions for model parameters is also discussed in detail, and two examples are presented. For the first example, a three-way table, the model probabilities calculated using our reversible jump approach are compared with model probabilities calculated exactly or by using an alternative approximation. The second example is a six-way contingency table for which exact methods are infeasible, because of the l...
This article proposes a new framework for the construction of reversible Markov chain samplers that ...
Inference for Dirichlet process hierarchical models is typically performed using Markov chain Monte ...
Analysis of large dimensional contingency tables is rather difficult. Fienberg and Kim (1999, Journa...
We derive an explicit form of a Markov basis on the junction tree for a decomposable log-linear mode...
We use a close connection between the theory of Markov fields and that of log-linear interaction mod...
We develop a Markov chain Monte Carlo algorithm, based on 'stochastic search variable selection' (Ge...
This paper deals with the Bayesian analysis of graphical models of marginal independence for three ...
The major implementational problem for reversible jump Markov chain Monte Carlo methods is that ther...
The major implementational problem for reversible jump Markov chain Monte Carlo methods is that ther...
We review the across-model simulation approach to computation for Bayesian model determination, base...
A comprehensive study of graphical log-linear models for contingency tables is presented. High-dimen...
a b s t r a c t We present an overview of Markov chain Monte Carlo, a sampling method for model infe...
This article considers Markov chain computational methods for incorporating uncertainty about the d...
The aim of this paper is to demonstrate the R package conting for the Bayesian analysis of complet...
Asmussen & Edwards (1983) defined necessary and sufficient conditions for collapsibil-ity of a h...
This article proposes a new framework for the construction of reversible Markov chain samplers that ...
Inference for Dirichlet process hierarchical models is typically performed using Markov chain Monte ...
Analysis of large dimensional contingency tables is rather difficult. Fienberg and Kim (1999, Journa...
We derive an explicit form of a Markov basis on the junction tree for a decomposable log-linear mode...
We use a close connection between the theory of Markov fields and that of log-linear interaction mod...
We develop a Markov chain Monte Carlo algorithm, based on 'stochastic search variable selection' (Ge...
This paper deals with the Bayesian analysis of graphical models of marginal independence for three ...
The major implementational problem for reversible jump Markov chain Monte Carlo methods is that ther...
The major implementational problem for reversible jump Markov chain Monte Carlo methods is that ther...
We review the across-model simulation approach to computation for Bayesian model determination, base...
A comprehensive study of graphical log-linear models for contingency tables is presented. High-dimen...
a b s t r a c t We present an overview of Markov chain Monte Carlo, a sampling method for model infe...
This article considers Markov chain computational methods for incorporating uncertainty about the d...
The aim of this paper is to demonstrate the R package conting for the Bayesian analysis of complet...
Asmussen & Edwards (1983) defined necessary and sufficient conditions for collapsibil-ity of a h...
This article proposes a new framework for the construction of reversible Markov chain samplers that ...
Inference for Dirichlet process hierarchical models is typically performed using Markov chain Monte ...
Analysis of large dimensional contingency tables is rather difficult. Fienberg and Kim (1999, Journa...