Run Probabilities in Sequences of Markov-Dependent Trials
From MaRDI portal
Publication:4747336
DOI10.2307/2287125zbMath0509.60069OpenAlexW4233869117MaRDI QIDQ4747336
Publication date: 1983
Full work available at URL: https://hdl.handle.net/1813/32867
run probabilitiesruns distributionsruns testsmultiple Markov dependencesequences of Markov-dependent trialstime-dependent trials
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical solutions to stochastic differential and integral equations (65C30) Distribution theory (60E99)
Related Items (27)
Generalized run tests for statistical process control ⋮ Sensitivity analysis and efficient method for identifying optimal spaced seeds ⋮ On the length and the position of the minimum sequence containing all runs of ones in a Markovian binary sequence ⋮ Reliability computing method for generalized \(k\)-out-of-\(n\) system ⋮ Hitting times of sequences ⋮ Weak runs in sequences of binary trials ⋮ Joint distributions of runs in a sequence of higher-order two-state Markov trials ⋮ Joint distributions of numbers of success-runs and failures until the first consecutive \(k\) successes ⋮ Range reliability in random walks ⋮ Distributions of statistics describing concentration of runs in non homogeneous Markov-dependent trials ⋮ 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 ⋮ Non-parametric randomness tests based on success runs of fixed length ⋮ On the length of the longest head run ⋮ Exact and asymptotic results for pattern waiting times ⋮ Approximating the extreme right-hand tail probability for the distribution of the number of patterns in a sequence of multi-state trials ⋮ Rate of convergence in the problem of the longest head-run ⋮ Joint distributions of numbers of occurrences of a discrete pattern and weak convergence of an empirical process for the pattern ⋮ Approximating the distributions of runs and patterns ⋮ Sooner and later waiting time problems for Markovian Bernoulli trials ⋮ Stopping Probabilities for Patterns in Markov Chains ⋮ On the distribution and expectation of success runs in nonhomogeneous Markov dependent trials ⋮ On the joint distribution of runs in the sequence of Markov-dependent multi-state trials ⋮ Success run statistics defined on an urn model ⋮ Formulae and recursions for the joint distributions of success runs of several lengths in a two-state Markov chain ⋮ Matching rectangles in d-dimensions: Algorithms and laws of large numbers ⋮ An algorithm to compute the probability of a run in binary fourth-order Markovian trials.
This page was built for publication: Run Probabilities in Sequences of Markov-Dependent Trials
