Limit theorems for runs based on `small spacings' (Q618005)

From MaRDI portal
Revision as of 22:34, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Limit theorems for runs based on `small spacings'
scientific article

    Statements

    Limit theorems for runs based on `small spacings' (English)
    0 references
    14 January 2011
    0 references
    The following type of runs was proposed by Erylmaz and Stepanov (2008): a sequence of spacings forms a run if the lengths of these spacings do not exceed \(\epsilon > 0\). Asymptotic properties of these spacings were investigated and a statistical test proposed by them. In the present paper, the research on these runs is continued; limit theorems are derived for the total number of runs and for the longest run. A procedure based on these runs is proposed to test for the uniformity or exponentiality of the underlying distribution.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references