On Runs and Longest Run Tests: A Method of Finite Markov Chain Imbedding

DOI10.2307/2291585zbMATH Open0881.62086OpenAlexW4244870744MaRDI QIDQ4366104FDOQ4366104

W. Y. Wendy Lou

Publication date: 22 February 1998

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2291585

Recommendations

• On the distribution of the total number of run lengths
• An application of the method of finite Markov chain imbedding to runs tests
• Distribution Theory of Runs: A Markov Chain Approach
• Conditional waiting time distributions of runs and patterns and their applications

zbMATH Keywords

Bernoulli trialsbinary longitudinal datatransition probability matrixasthmatics

Mathematics Subject Classification ID

Probabilistic methods, stochastic differential equations (65C99) Markov processes: hypothesis testing (62M02) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cited In (33)

• The distribution of extended discrete random sums and its application to waiting time distributions
• On the distribution and expectation of success runs in nonhomogeneous Markov dependent trials
• Run Statistics Defined on the Multicolor URN Model
• Estimating the distribution of one-dimensional discrete scan statistics viewed as extremes of 1-dependent stationary sequences
• A Runs Test Based on Run Lengths
• An application of the method of finite Markov chain imbedding to runs tests
• On ordered series and later waiting time distributions in a sequence of Markov dependent multistate trials
• Distribution of the length of the longest common subsequence of two multi-state biological sequences
• Chess, chance and conspiracy
• Confidence bands for the CDF when sampling from a finite population
• Monitoring phase II comparative clinical trials with two endpoints and penalty for adverse events
• Some results associated with the longest run statistic in a sequence of Markov dependent trials
• On the tail probability of the longest well-matching run.
• Non-parametric randomness tests based on success runs of fixed length
• Some results associated with the longest run in a strongly ergodic Markov chain
• Generalized run tests for statistical process control
• A test statistic for weighted runs
• The exact distribution of the \(k\)-tuple statistic for sequence homology
• On run statistics for binary trials
• Waiting time distributions of simple and compound patterns in a sequence of \(r\)th order Markov dependent multi-state trials
• The \(m\)th longest runs of multivariate random sequences
• On the distribution of the total number of run lengths
• Recursive equations in finite Markov chain imbedding
• Shortest and longest length of success runs in binary sequences
• On the length of the longest run in a multi-state Markov chain.
• Conditional waiting time distributions of runs and patterns and their applications
• The exact distribution of the continuity of care measure NOP
• On distribution of the number of peaks and the Euler numbers of permutations
• On the exact distributions of Eulerian and Simon Newcomb numbers associated with random permutations
• On exact type I and type II errors of Cochran's test
• The distribution of increasing \(l\)-sequences in random permutations: A Markov chain approach
• Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
• On exact and large deviation approximation for the distribution of the longest run in a sequence of two-state Markov dependent trials

This page was built for publication: On Runs and Longest Run Tests: A Method of Finite Markov Chain Imbedding

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