Singles in a Markov chain
AbstractLet 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).
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Hogeschool-Universiteit Brussel, Faculteit Economie en Management in its series Working Papers with number 2007/17.
Length: 14 pages
Date of creation: Sep 2007
Date of revision:
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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.