Berry-Esseen and central limit theorems for serial rank statistics via graphs
From MaRDI portal
Publication:1769775
DOI10.3150/bj/1082380218zbMath1071.62046OpenAlexW2103089393MaRDI QIDQ1769775
Publication date: 30 March 2005
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3150/bj/1082380218
Asymptotic properties of nonparametric inference (62G20) Central limit and other weak theorems (60F05) Applications of graph theory (05C90) Combinatorial probability (60C05)
Cites Work
- Unnamed Item
- Unnamed Item
- Linear serial rank tests for randomness against ARMA alternatives
- A short proof of Motoo's combinatorial central limit theorem using Stein's method
- Optimal rank-based procedures for time series analysis: testing an ARMA model against other ARMA models
- Asymptotic expansions for the power of distribution free tests in the one-sample problem
- The rate of convergence for multivariate sampling statistics
- Aligned rank tests for linear models with autocorrelated error terms
- On Latin hypercube sampling
- Error bound in a central limit theorem of double-indexed permutation statistics
- A Berry-Esséen theorem for serial rank statistics
- A study of serial ranks via random graphs
- An estimate of the remainder in a combinatorial central limit theorem
- An Exact Test for Randomness in the Non-Parametric Case Based on Serial Correlation
- Motoo's combinatorial central limit theorem for serial rank statistics