Search Results
Showing results 1 to 2 of approximately 2.
(refine search)
Working Paper
A moment-matching method for approximating vector autoregressive processes by finite-state Markov chains
This paper proposes a moment-matching method for approximating vector autoregressions by finite-state Markov chains. The Markov chain is constructed by targeting the conditional moments of the underlying continuous process. The proposed method is more robust to the number of discrete values and tends to outperform the existing methods for approximating multivariate processes over a wide range of the parameter space, especially for highly persistent vector autoregressions with roots near the unit circle.
Working Paper
Finite-State Markov-Chain Approximations: A Hidden Markov Approach
This paper proposes a novel finite-state Markov chain approximation method for Markov processes with continuous support, providing both an optimal grid and transition probability matrix. The method can be used for multivariate processes, as well as non-stationary processes such as those with a life-cycle component. The method is based on minimizing the information loss between a Hidden Markov Model and the true data-generating process. We provide sufficient conditions under which this information loss can be made arbitrarily small if enough grid points are used. We compare our method to ...