Joint distributions of numbers of runs of specified lengths on directed trees
Consider a directed tree \(T\) with vertices \(V\), including a root vertex \(v_0\). Let \(pa(v)\) denote the parent vertex of \(v\in V\) in \(T\). The authors study the Markov directed tree \(\{X_v,v\in V\}\), a collection of \(\{0,1\}\)-valued random variables such that \(P(X_{v_0}=1)=p\), \[ P(X_v=1 | X_{pa(v)}=1)=p_{11}\,,\qquad\text{and}\qquad P(X_v=1 | X_{pa(v)}=0)=p_{01}\,, \] for all \(v\not=v_0\). Their interest is in the exact joint distribution of numbers of runs of given lengths and with a given amount of overlap on the Markov directed tree. The main results of the present paper give recurrence relations satisfied by the probability generating function of this joint distribution. An explicit algorithm and examples are provided to illustrate the use of these recurrence relations to derive the probability generating function. Applications are also provided to reliability systems, in which each vertex of the tree corresponds to an independent component of the system, with each component either in an operating or failed state. Failure of an individual component occurs according to some given distribution. The entire system fails if either there are at least \(k\) consecutive failed components, or \(f\) failed components in total. System reliability and lifetime distributions are calculated, and some statistical estimation problems for the parameters of the failure time distribution of an individual component are considered.
- Distributions of runs and consecutive systems on directed trees
- Joint distributions of numbers of success-runs and failures until the first consecutive \(k\) successes
- Distributions of Runs and Scans on Higher-Order Markov Trees
- On the joint distribution of runs in the sequence of Markov-dependent multi-state trials
- Joint distributions of numbers of success runs of specified lengths in linear and circular se\-quences
- A generalized geometric distribution and some of its properties
- Distribution theory of runs and patterns and its applications. A finite Markov chain imbedding approach
- Distribution Theory of Runs: A Markov Chain Approach
- Distributions of numbers of runs and scans on directed acyclic graphs with generation
- Distributions of numbers of success runs of fixed length in Markov dependent trials
- Distributions of runs and consecutive systems on directed trees
- Distributions of Runs and Scans on Higher-Order Markov Trees
- Exact Distributions of the Number of Pattern Occurrences in Undirected Graphical Models
- Formulae and recursions for the joint distribution of success runs of several lengths
- Formulae and recursions for the joint distributions of success runs of several lengths in a two-state Markov chain
- Generalized binomial and negative binomial distributions of order k by the -overlapping enumeration scheme
- scientific article; zbMATH DE number 1576829 (Why is no real title available?)
- scientific article; zbMATH DE number 19717 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 947423 (Why is no real title available?)
- scientific article; zbMATH DE number 835699 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- Joint distribution of run statistics in partially exchangeable processes
- Joint distributions of numbers of success runs of specified lengths in linear and circular se\-quences
- Numbers of success-runs of specified length until certain stopping time rules and generalized binomial distributions of order k
- On binomial and circular binomial distributions of order k for l-overlapping success runs of length k
- On binomial distributions of order k
- On the conditional and unconditional distributions of the number of success runs on a circle with applications
- On the dual reliability systems of \((n,f,k)\) and \(\langle n,f,k \rangle\)
- Run Statistics Defined on the Multicolor URN Model
- Runs and scans with applications
- Runs, scans and urn model distributions: A unified Markov chain approach
- Sooner and later waiting time problems for Bernoulli trials: Frequency and run quotas
- Sooner waiting time problems in a sequence of trinary trials
- Start-up demonstration tests under Markov dependence model with corrective actions
- Start-up demonstration tests with three-level classification
- Success run statistics defined on an urn model
- The Distribution Theory of Runs
This page was built for publication: Joint distributions of numbers of runs of specified lengths on directed trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1706471)