Singles in a Markov chain
Let fXi; i _ 1g denote a sequence of variables that take values in f0; 1g and suppose that the sequence forms a Markov chain with transition matrix P and with initial distribution (q; p) = (P(X1 = 0); P(X1 = 1)). Several authors have studied the quantities Sn, Y (r) and AR(n), where Sn = Pn i=1 Xi denotes the number of successes, where Y (r) denotes the number of experiments up to the r??th success and where AR(n) denotes the number of runs. In the present paper we study the number of singles AS(n) in the vector (X1;X2; :::;Xn). A single in a sequence is an isolated value of 0 or 1, i.e. a run of lenght 1. Among others we prove a central limit theorem for AS(n).
|Date of creation:||Sep 2007|
|Date of revision:|
|Contact details of provider:|| Web page: http://research.hubrussel.be|
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:hub:wpecon:200717. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sabine Janssens)
If references are entirely missing, you can add them using this form.