Distributions of Runs and Scans on Higher-Order Markov Trees

DOI10.1080/03610920802272406zbMath1161.60302MaRDI QIDQ3622077

Kiyoshi Inoue, Sigeo Aki

Publication date: 23 April 2009

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610920802272406

zbMATH Keywords

scan; graph; reliability; probability generating function; success run; directed tree; enumeration schemes; consecutive system; higher-order Markov tree

Mathematics Subject Classification ID

60E05: Probability distributions: general theory

60J10: Markov chains (discrete-time Markov processes on discrete state spaces)

Related Items

Joint distributions of numbers of runs of specified lengths on directed trees, Distributions of numbers of runs and scans on directed acyclic graphs with generation, Discrete Scan Statistics Generated by Exchangeable Binary Trials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Joint distributions of numbers of success runs of specified lengths in linear and circular se\-quences
• On binomial distributions of order k
• Joint distributions of numbers of success-runs until the first consecutive \(k\) successes in a higher-order two-state Markov chain
• Distributions of runs and consecutive systems on directed trees
• Start-up demonstration tests under Markov dependence model with corrective actions
• Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials
• Runs, scans and urn model distributions: A unified Markov chain approach
• Poisson approximation and dna sequence matching
• Distribution Theory of Runs: A Markov Chain Approach
• The Distribution Theory of Runs