Limit theorems for runs based on `small spacings' (Q618005)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Limit theorems for runs based on `small spacings' |
scientific article; zbMATH DE number 5836633
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Limit theorems for runs based on `small spacings' |
scientific article; zbMATH DE number 5836633 |
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
