Open
Description
The hitting probabilities function is very slow for large markov chains. Users should have the option to select the target states so that unneeded values aren’t computed.
Additionally, directly solving this system of equations is impractical in many cases. Users should have the option to use numerical methods to solve for hitting (and absorption) probabilities. I have found that biconjugate gradient descent works very well for this purpose and can be many orders of magnitude faster than directly solving, even when the identity matrix is used as a preconditioner.
Metadata
Metadata
Assignees
Labels
No labels