1986
DOI: 10.1016/0165-1765(86)90168-0
|View full text |Cite
|
Sign up to set email alerts
|

Finite state markov-chain approximations to univariate and vector autoregressions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
788
0
6

Year Published

1994
1994
2020
2020

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 1,223 publications
(797 citation statements)
references
References 5 publications
3
788
0
6
Order By: Relevance
“…The grid is chosen to capture al-most all movements of the income distribution F later on. 10 Given this grid, we can use Tauchen's (1986) algorithm to obtain the transition probabilities for the Markov-chain approximation of the income process in (17) :…”
Section: Numerical Aspectsmentioning
confidence: 99%
“…The grid is chosen to capture al-most all movements of the income distribution F later on. 10 Given this grid, we can use Tauchen's (1986) algorithm to obtain the transition probabilities for the Markov-chain approximation of the income process in (17) :…”
Section: Numerical Aspectsmentioning
confidence: 99%
“…As it is standard in the literature I discretize the continuous time process described in (6) as a …rst-order Markov chain with transition matrix Q using Tauchen (1986) procedure. I assume Pr fz 0 = z j jz = z i g = Q ij 0 and P j Q ij = 1 for each i = 1; : : : ; N z : The sequence of aggregate shocks A t is known with perfect foresight.…”
Section: Firmsmentioning
confidence: 99%
“…Since firms' technologies are heterogeneous, the ergodic sets for z and k differ depending on the parameters. To compute expectations over future productivity shocks, we follow Tauchen (1986). We construct an equally spaced grid with n z = 25 points for log(z j ) that spans eight standard deviations of the ergodic distribution, that is log(z j ) ∈…”
Section: Modelmentioning
confidence: 99%