Limit theorems for runs based on `small spacings'
From MaRDI portal
(Redirected from Publication:618005)
Recommendations
Cites work
- scientific article; zbMATH DE number 5788579 (Why is no real title available?)
- scientific article; zbMATH DE number 3592801 (Why is no real title available?)
- A note on the number of observations near an order statistic
- A note on the number of records near the maximum
- A note on the paper of Khmaladze et al
- An elementary proof of the strong law of large numbers
- 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
- Distribution theory of runs and patterns and its applications. A finite Markov chain imbedding approach
- Extension of runs to the continuous-valued sequences
- How Many Observations Fall in a Neighborhood of an Order Statistic?
- ON THE NUMBER OF RECORDS NEAR THE MAXIMUM
- On the distribution and expectation of success runs in nonhomogeneous Markov dependent trials
- Runs and scans with applications
- Runs in an ordered sequence of random variables
- Testing for dispersive ordering
Cited in
(4)- scientific article; zbMATH DE number 7444241 (Why is no real title available?)
- 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)