MarkovChain simulate: Match with python version #77
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This is to propose matching the
simulate
method with that in the Python version (see QuantEcon/QuantEcon.py#146 (comment)). It works as follows:As discussed in #52 (comment), it uses
searchsortedfirst
(viaDiscreteRV
). The method usingsearchsortedfirst
(simulate
) seems faster than the previous one usingCategorical
(mc_sample_path
) for medium- and large-size Markov chains; see mc_simulate.jl.ipynb.In passing, Numba seems to do a good job; see mc_simulate.py.ipynb.
I am not sure if I properly exploited the multiple dispatch system of Julia. Any suggestion/correction etc will be welcome!