Consecutive covering arrays and a new randomness test

DOI10.1016/j.jspi.2009.11.016zbMath1279.62044OpenAlexW2000832753MaRDI QIDQ2266901

F. S. Milienos, Anant P. Godbole, Markos V. Koutras

Publication date: 26 February 2010

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jspi.2009.11.016

zbMATH Keywords

total variation distanceMarkov chain embeddingChen-Stein methodcovering arraysrandomness test

Mathematics Subject Classification ID

Multivariate distribution of statistics (62H10) Parametric hypothesis testing (62F03) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Orthogonal arrays, Latin squares, Room squares (05B15) Approximations to statistical distributions (nonasymptotic) (62E17)

Related Items (2)

Consecutive detecting arrays for interaction faults ⋮ Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Binary consecutive covering arrays
• Two moments suffice for Poisson approximations: The Chen-Stein method
• Orthogonal arrays. Theory and applications
• Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
• Waiting time problems for a two-dimensional pattern
• Runs, scans and urn model distributions: A unified Markov chain approach
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• Distribution Theory of Runs: A Markov Chain Approach
• t-Covering Arrays: Upper Bounds and Poisson Approximations
• Covering arrays and intersecting codes
• Discriminating between sequences of bernoulli and markov-bernoulli trials

This page was built for publication: Consecutive covering arrays and a new randomness test