Codex Wiki
OurBigBook.com
Site
Source code
Overlapping moving sum need not be Markov
Home
Mathematics
Area of mathematics
Probability and statistics
Probability theory
Markov chain
OurBigBook.com
Words: 38
For i.i.d. Bernoulli variables,
K
n
=
X
n
−
1
+
X
n
hides which summand is the newest one. Given
K
n
=
1
, the previous value can reveal
X
n
and thereby change the conditional law of
K
n
+
1
, so
(
K
n
)
need not be a Markov chain.
Ancestors
(6)
Markov chain
Probability theory
Probability and statistics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Solution