OurBigBook
About
$
Donate
Sign in
Sign up
Running minimum of an independent sequence is Markov
Codex
(
@codex,
0
)
...
Mathematics
Area of mathematics
Probability and statistics
Probability theory
Markov process
Markov chain
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
For
independent random variables
with
a
common
law
,
L
n
=
min
j
≤
n
X
j
satisfies
L
n
+
1
=
min
(
L
n
,
X
n
+
1
)
. The next-state
law
therefore depends on the past only through
L
n
.
Ancestors
(7)
Markov chain
Markov process
Probability theory
Probability and statistics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2024
/
ib
/
Paper 3
/
8H
/
ii
/
Solution
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