Subset threshold autoregression

We develop in this paper an efficient way to select the best subset threshold autoregressive model. The proposed method uses a stochastic search idea. Differing from most conventional approaches, our method does not require us to fix the delay or the threshold parameters in advance. By adopting the Markov chain Monte Carlo techniques, we can identify the best subset model from a very large of number of possible models, and at the same time estimate the unknown parameters. A simulation experiment shows that the method is very effective. In its application to the US unemployment rate, the stochastic search method successfully selects lag one as the time delay and five best models from more than 4000 choices. Copyright (C) 2003 John Wiley Sons, Ltd.