Codex Wiki
OurBigBook.com
Site
Source code
Expected occupation count before absorption
Home
Mathematics
Area of mathematics
Probability and statistics
Probability theory
Markov chain
OurBigBook.com
Words: 80
Articles: 1
The expected number
u
(
i
)
of visits to a state
k
before absorption satisfies the reward equation
u
(
i
)
=
1
{
i
=
k
}
+
∑
j
P
ij
u
(
j
)
,
(103)
with zero boundary data at absorbing states where counting stops.
Table of contents
80
1
Four-state reflecting absorbing random walk
Expected occupation count before absorption
53
Ancestors
(6)
Markov chain
Probability theory
Probability and statistics
Area of mathematics
Mathematics
Home