Hybrid Methods for Running MCMC over I× J× K Contingency Tables

by   David Barnhill, et al.

We consider an I × J× K table with cell counts X_ijk≥ 0 for i = 1, … , I, j = 1, … , J and k = 1, … , K under the no-three-way interaction model. In this paper, we propose a Markov Chain Monte Carlo (MCMC) scheme connecting the set of all contingency tables by all basic moves of 2 × 2 × 2 minors with allowing X_ijk≥ -1 combined with simulated annealing. In addition, we propose a hybrid scheme of MCMC with basic moves by allowing -1 in cell counts combined with simulated annealing and Hit and Run (HAR) algorithm proposed by Andersen and Diaconis in order to improve a mixing time. We also compare this hybrid scheme with a hybrid method of sequential importance sampling (SIS) and MCMC introduced by Kahle, Yoshida, and Garcia-Puente. We apply these hybrid schemes to simulated and empirical data on Naval officer and enlisted population.


Simulated Annealing Algorithm for Graph Coloring

The goal of this Random Walks project is to code and experiment the Mark...

Using Simulated Annealing to Calculate the Trembles of Trembling Hand Perfection

Within the literature on non-cooperative game theory, there have been a ...

Finite space Kantorovich problem with an MCMC of table moves

In Optimal Transport (OT) on a finite metric space, one defines a distan...

Analysis of the weighted kappa and its maximum with Markov moves

In this paper the notion of Markov move from Algebraic Statistics is use...

A novel Empirical Bayes with Reversible Jump Markov Chain in User-Movie Recommendation system

In this article we select the unknown dimension of the feature by re- ve...

Diffuse optical tomography by simulated annealing via a spin Hamiltonian

The inverse problem of diffuse optical tomography is solved by the Marko...

Computing Kantorovich distance with a MCMC of moves

In Optimal Transport (OT) on a finite metric space, one defines a distan...