Limit theorems for runs based on 'small spacings'

A. Stepanov

Statistics & Probability Letters, 2011, vol. 81, issue 1, 54-61

Abstract: 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.

Keywords: Order; statistics; Spacings; Limit; theorems; Hypothesis; testing (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(10)00268-3
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:81:y:2011:i:1:p:54-61

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().