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...

Non-stationary income processes are standard in quantitative life-cycle models, prompted by the observation that within-cohort income inequality increases with age. This paper generalizes Tauchen (1986) and Rouwenhorst's (1995) discretization methods to non-stationary AR(1) processes. We...

Approximating stochastic processes by finite-state Markov chains is useful for reducing computational complexity when solving dynamic economic models. We provide a new method for accurately discretizing general Markov processes by matching low order moments of the conditional distributions using...

The "histogram method" (Young, 2010), while the standard approach for analyzing distributional dynamics in heterogeneous agent models, is linear in optimal policies. We introduce a novel method that captures nonlinearities of distributional dynamics. This method solves the distributional...

Sensitivity analysis studies how the variation in the numerical output of a model can be quantitatively apportioned to different sources of variation in basic input parameters. Thus, it serves to examine the robustness of numerical results with respect to input parameters, which is a...

In Monte Carlo simulation, Latin hypercube sampling (LHS) [McKay et al. (1979)] is a well-known variance reduction technique for vectors of independent random variables. The method presented here, Latin hypercube sampling with dependence (LHSD), extends LHS to vectors of dependent random...

Adaptive Polar Sampling (APS) is proposed as a Markov chain Monte Carlomethod for Bayesian analysis of models with ill-behaved posteriordistributions. In order to sample efficiently from such a distribution,a location-scale transformation and a transformation to polarcoordinates are used. After...

We apply the splitting method to three well-known counting problems, namely 3-SAT, random graphs with prescribed degrees, and binary contingency tables. We present an enhanced version of the splitting method based on the capture-recapture technique, and show by experiments the superiority of...

We show how it is possible to generate multivariate data which have moments arbitrary close to the desired ones. They are generated as linear combinations of variables with known theoretical moments. It is shown how to derive the weights of the linear combinations in both the univariate and the...

We introduce new stylometry tools based on the sliced conditional compression complexity of literary texts which are inspired by the nearly optimal application of the incomputable Kolmogorov conditional complexity (and presumably approximates it). Whereas other stylometry tools can occasionally...