Limit theorems for runs based on `small spacings'

DOI10.1016/J.SPL.2010.09.018zbMATH Open1218.62045OpenAlexW2090644884MaRDI QIDQ618005FDOQ618005

A. Stepanov

Publication date: 14 January 2011

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2010.09.018

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Central limit and other weak theorems (60F05) Order statistics; empirical distribution functions (62G30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on the number of observations near an order statistic
• Distribution theory of runs and patterns and its applications. A finite Markov chain imbedding approach
• Runs and scans with applications
• How Many Observations Fall in a Neighborhood of an Order Statistic?
• ON THE NUMBER OF RECORDS NEAR THE MAXIMUM
• An elementary proof of the strong law of large numbers
• A note on the number of records near the maximum
• Testing for dispersive ordering
• On the distribution and expectation of success runs in nonhomogeneous Markov dependent trials
• Runs in an ordered sequence of random variables
• Extension of runs to the continuous-valued sequences
• A note on the paper of Khmaladze et al
• Asymptotic properties of numbers of near minimum observations under progressive type-II censoring
• Criteria for convergence of the number of near maxima for long tails

Cited In (4)

• Title not available (Why is that?)
• Some limit theorems of runs to the continuous‐valued sequence
• Asymptotic results for runs and empirical cumulative entropies
• Runs based on records: their distributional properties and an application to testing for dispersive ordering

This page was built for publication: Limit theorems for runs based on `small spacings'

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q618005)