MATHEMATICAL ENGINEERING TECHNICAL REPORTS Markov Chain Monte Carlo Test of Toric Homogeneous Markov Chains

نویسندگان

  • Akimichi TAKEMURA
  • Hisayuki HARA
  • Akimichi Takemura
  • Hisayuki Hara
چکیده

Markov chain models are used in various fields, such behavioral sciences or econometrics. Although the goodness of fit of the model is usually assessed by large sample approximation, it is desirable to use conditional tests if the sample size is not large. We study Markov bases for performing conditional tests of the toric homogeneous Markov chain model, which is the envelope exponential family for the usual homogeneous Markov chain model. We give a complete description of a Markov basis for the following cases: i) two-state, arbitrary length, ii) arbitrary finite state space and length of three. The general case remains to be a conjecture. We also present numerical examples of conditional tests based on our Markov basis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Markov Degree of the Three-State Toric Homogeneous Markov Chain Model

Markov chain models had proved to be useful tools in many fields, such as physics, chemistry, information sciences, economics, finances, mathematical biology, social sciences, and statistics for analyzing data. A discrete time Markov chain is often used as a statistical model from a random physical process to fit the observed data. A time-homogeneous Markov chain is a process that each transiti...

متن کامل

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Graver Basis for an Undirected Graph and Its Application to Testing the Beta Model of Random Graphs

In this paper we give an explicit and algorithmic description of Graver basis for the toric ideal associated with a simple undirected graph and apply the basis for testing the beta model of random graphs by Markov chain Monte Carlo method.

متن کامل

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Polynomial-time Randomized Approximation and Perfect Sampler for Closed Jackson Networks with Single Servers

In this paper, we propose the first fully polynomial-time randomized approximation scheme (FPRAS) for basic queueing networks, closed Jackson networks with single servers. Our algorithm is based on MCMC (Markov chain Monte Carlo) method. Thus, our scheme returns an approximate solution, of which the size of error satisfies a given error rate. We propose two Markov chains, one is for approximate...

متن کامل

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Markov chain Monte Carlo tests for designed experiments

We consider conditional exact tests of factor effects in designed experiments for discrete response variables. Similarly to the analysis of contingency tables, a Markov chain Monte Carlo method can be used for performing exact tests, when large-sample approximations are poor and the enumeration of the conditional sample space is infeasible. For designed experiments with a single observation for...

متن کامل

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Hamiltonian Monte Carlo with Explicit, Reversible, and Volume-preserving Adaptive Step Size Control

Hamiltonian Monte Carlo is a Markov chain Monte Carlo method that uses Hamiltonian dynamics to efficiently produce distant samples. It employs geometric numerical integration to simulate Hamiltonian dynamics, which is a key of its high performance. We present a Hamiltonian Monte Carlo method with adaptive step size control to further enhance the efficiency. We propose a new explicit, reversible...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010