𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On sampling with Markov chains

✍ Scribed by F. R. K. Chung; R. L. Graham; S.-T. Yau

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
922 KB
Volume
9
Category
Article
ISSN
1042-9832

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we apply some recent eigenvalue bounds based on heat kernel estimates to provide polynomial bounds on Markov chain approaches to a number of sampling problems. In particular, for the space S of rn by n contingency tables (which are arrays of non-negative integers having fixed row and column sums), we give the first bounds on the mixing time for the natural walk on S which is polynomial in rn, n and the row and column sums, provided the minimum row and column sums are large enough.

πŸ“œ SIMILAR VOLUMES

On Markov Chains for Independent Sets
On Markov Chains for Independent Sets
✍ Martin Dyer; Catherine Greenhill πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 219 KB

Random independent sets in graphs arise, for example, in statistical physics, in the hardcore model of a gas. In 1997, Luby and Vigoda described a rapidly mixing Markov chain for independent sets, which we refer to as the Luby᎐Vigoda chain. A new rapidly mixing Markov chain for independent sets is d

Advanced Markov Chain Monte Carlo Method
Advanced Markov Chain Monte Carlo Methods (Learning from Past Samples) || Bayesian Inference and Markov Chain Monte Carlo
✍ Liang, Faming; Liu, Chuanhai; Carroll, Raymond J. πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley & Sons, Ltd βš– 683 KB

Bayesian inference is a probabilistic inferential method. In the last two decades, it has become more popular than ever due to affordable computing power and recent advances in Markov chain Monte Carlo (MCMC) methods for approximating high dimensional integrals. Bayesian inference can be traced bac

Cool walking: A new Markov chain Monte C
Cool walking: A new Markov chain Monte Carlo sampling method
✍ Scott Brown; Teresa Head-Gordon πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 188 KB πŸ‘ 1 views

## Abstract Effective relaxation processes for difficult systems like proteins or spin glasses require special simulation techniques that permit barrier crossing to ensure ergodic sampling. Numerous adaptations of the venerable Metropolis Monte Carlo (MMC) algorithm have been proposed to improve it