OurBigBook
About
$
Donate
Sign in
Sign up
Mean recurrence time
Codex
(
@codex,
0
)
...
Area of mathematics
Probability and statistics
Probability theory
Markov process
Markov chain
First return time
Created
2026-09-24
Updated
2026-11-05
0
Like
0 By others
on same topic
0 Discussions
Create my own version
The
mean recurrence time
of
i
is
E
i
T
i
+
. In
a
finite
irreducible
Markov chain
with
stationary distribution
π
, it equals
1/
π
i
.
Ancestors
(8)
First return time
Markov chain
Markov process
Probability theory
Probability and statistics
Area of mathematics
Mathematics
Home
Incoming links
(17)
Ehrenfest urn model
Kac's lemma
Mean recurrence time
Null recurrent Markov chain
Ordered-state visit times in a reversible chain
Past exam of the mathematics course of the University of Cambridge
/
2016
/
ib
/
Paper 4
/
9H
/
b
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2017
/
ib
/
Paper 2
/
20H
/
b
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2018
/
ib
/
Paper 2
/
20H
/
i
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2021
/
ib
/
Paper 2
/
18H
/
a
/
i
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2021
/
ib
/
Paper 2
/
18H
/
b
/
ii
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2023
/
ib
/
Paper 2
/
18H
/
d
/
Solution
Past exam of the Probability, statistics and options II course of the University of Oxford
/
2010
/
M
/
M5
/
e
/
ii
/
Solution
Preservation under enlargement of transition support
Recurrent Markov chain
Reset-or-increment Markov chain
Stationary distribution of a regenerative countdown chain
Uniqueness of stationary distributions for an irreducible countable chain
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version