Funny feature of serial correlation coefficient...
- From: David Tischler <davgmar@xxxxxxxxxxxxxx>
- Date: Fri, 13 Jul 2007 08:19:59 -0700
Hallo,
let {x_0,x_1,x_2,...} a sequence of outcomes of the random variable X
which can take only two values 0 or 1 (the sequence can be considered
as a string of bit). Does anybody knows where I can find the proof
(books, weblinks, papers...) that the serial correlation coefficient
(SCC) with lag 1, corresponds to the sum of transition probabilities
between an outcome and the following one:
SCC(x_i,x_(i+1)) = p(1->1) + p(0->0) - p(0->1) - p(1->0)
Thanks for any reference!
David Tischler
.
- Follow-Ups:
- Re: Funny feature of serial correlation coefficient...
- From: Ken Pledger
- Re: Funny feature of serial correlation coefficient...
- Prev by Date: Parametrical solutions of y^(2*x)=x^(3*y)
- Next by Date: Re: Ultimate debunking of Cantor's Theory
- Previous by thread: Parametrical solutions of y^(2*x)=x^(3*y)
- Next by thread: Re: Funny feature of serial correlation coefficient...
- Index(es):
Relevant Pages
|