You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+13-2Lines changed: 13 additions & 2 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -35,10 +35,21 @@ The probability to get from state `1` to state `0` is `0.3`.
35
35
Suppose the motion begins at state `1`. How can we calculate the probability that we will get to state `R`
36
36
before we get to state `L`? What is the probability we will get to state `3` before `L` and `R`?
37
37
38
-
# The code
38
+
# What the module does
39
39
40
40
The described problem is [well modeled](https://math.stackexchange.com/a/2912626) by [Absorbing Markov chains](https://en.wikipedia.org/wiki/Absorbing_Markov_chain).
41
-
The code performs the necessary matrix calculations in `numpy` and returns the answers as `float` numbers.
41
+
The code performs the necessary matrix calculations in `numpy` and returns the answers as `float` numbers.
0 commit comments