Limit theorems for runs based on 'small spacings'
A new concept of runs was proposed in the work of Eryilmaz and Stepanov (2008). A sequence of spacings forms a run if the lengths of these spacings do not exceed [epsilon]>0. In that paper, asymptotic properties of such spacings were investigated and statistical criteria proposed. In our present study, we maintain research on runs associated with these spacings. We derive limit theorems for the total number of runs, longest run and propose a statistical criterion.
Year of publication: |
2011
|
---|---|
Authors: | Stepanov, A. |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 81.2011, 1, p. 54-61
|
Publisher: |
Elsevier |
Keywords: | Order statistics Spacings Limit theorems Hypothesis testing |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Numbers of near bivariate record-concomitant observations
Bairamov, I., (2011)
-
On the 240 K anomaly in the magnetic properties of LiNiO<Subscript>2</Subscript>
Reynaud, F., (2000)
-
Nevzorov, V.B., (2014)
- More ...