The role of Markov chain in Monte Carlo simulation

Abstract

The Markov Chain Monte Carlo method has been applied in several fields and has thrived in academic research over the past few decades. The method is utilized to estimate the interest parameters posterior distribution through random sampling in the probability space. Monte Carlo method alone can accomplish random simulations for some complicated continuous integrals or discrete summations. However, the method requires the sample set corresponding to the distribution, which demands the application of Markov chain. Nevertheless, problems occur when the probability function of the samples remain unknown, under which circumstance the Markov Chain Monte Carlo method is no longer available. Therefore, the article introduced Metropolis-Hastings Algorithm as a resolution. The paper is intended to provide specific insights about Metropolis-Hastings Algorithm for Markov Chain Monte Carlo and the corresponding interdisciplinary applications. Specifically, the paper will discuss about using the theory mentioned above to check the relationships among species in a common ecosystem. The paper will cover several prepositive theories, including the Law of Large Numbers for Markov Chains, binary sequences, and Metropolis-Hastings Algorithm. Overall, specific cases and the way to draw correct conclusions will be most concerned.