# hitprob

Compute Markov chain hitting probabilities

## Syntax

## Description

## Examples

## Input Arguments

## Output Arguments

## More About

## Algorithms

`hitprob`

uses `linprog`

to find the minimum norm nonnegative solution to the system:

$$\{\begin{array}{cc}{h}_{i}^{A}=1& ,i\in A\\ {h}_{i}^{A}={\displaystyle \sum _{j=1}^{N}{P}_{ij}{h}_{j}^{A}}& ,i\notin A,\end{array}$$

where

## References

[1]
Norris, J. R. *Markov Chains.* Cambridge, UK: Cambridge University Press, 1997.

## Version History

**Introduced in R2019b**