Geometric Allocation Approach for Transition Kernel of Markov Chain

Details Geometric Allocation Approach for Transition Kernel of Markov Chain Geometric Allocation Approach for Transition Kernel of Markov Chain

2011-06-17

arxiv.org/abs/1106.3562v1

Physics

Condensed Matter

Statistical Mechanics

8 pages, 3 figures, submitted to proceedings of Eighth IMACS Seminar on Monte Carlo Methods

Scientific paper

We introduce a new geometric approach that constructs a transition kernel of Markov chain. Our method always minimizes the average rejection rate and even reduce it to zero in many relevant cases, which cannot be achieved by conventional methods, such as the Metropolis-Hastings algorithm or the heat bath algorithm (Gibbs sampler). Moreover, the geometric approach makes it possible to find not only a reversible but also an irreversible solution of rejection-free transition probabilities. This is the first versatile method that can construct an irreversible transition kernel in general cases. We demonstrate that the autocorrelation time (asymptotic variance) of the Potts model becomes more than 6 times as short as that by the conventional Metropolis-Hastings algorithm. Our algorithms are applicable to almost all kinds of Markov chain Monte Carlo methods and will improve the efficiency.

Affiliated with

Also associated with

No associations

Rating

Geometric Allocation Approach for Transition Kernel of Markov Chain does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Geometric Allocation Approach for Transition Kernel of Markov Chain, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometric Allocation Approach for Transition Kernel of Markov Chain will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-696868