Distribution Theory of Runs: A Markov Chain Approach
From MaRDI portal
Publication:4314909
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- Sensitivity analysis and efficient method for identifying optimal spaced seeds
- Joint distributions of numbers of runs of specified lengths in a sequence of Markov dependent multistate trials
- Minimal auxiliary Markov chains through sequential elimination of states
- Profust reliability of linear and circular type F and G systems having two failure criteria under Markov dependency
- Binary consecutive covering arrays
- On the modes of the negative binomial distribution of order \(k\)
- Faster exact distributions of pattern statistics through sequential elimination of states
- scientific article; zbMATH DE number 1959509 (Why is no real title available?)
- On the individuals chart with supplementary runs rules under serial dependence
- Distributions of numbers of runs and scans on directed acyclic graphs with generation
- On finite Markov chain imbedding and its applications
- R-2 composition tests: a family of statistical randomness tests for a collection of binary sequences
- The distributions of the frequency of occurrence of nucleotide subsequences
- The distribution of extended discrete random sums and its application to waiting time distributions
- Binomial distribution of order \(k\) in a modified binary sequence
- Explicit distributional results in pattern formation
- Runs in a Bivariate Sequence Over the First Coordinate
- On the distribution and expectation of success runs in nonhomogeneous Markov dependent trials
- Waiting time for consecutive repetitions of a pattern and related distributions
- Success run statistics defined on an urn model
- Digital search trees and chaos game representation
- Robust scan statistics for detecting a local change in population mean for normal data
- On longest consecutive patterns in Markov chains
- Multiple pattern matching: a Markov chain approach
- Distribution and double generating function of number of patterns in a sequence of Markov dependent multistate trials
- Statistical modeling for discrete patterns in a sequence of exchangeable trials
- Distributions related to weak runs with a minimum and a maximum number of successes: a unified approach
- Start-up demonstration tests: models, methods and applications, with some unifications
- Improved chi-square control charts with weak-run rules
- On generalized multi-state start-up demonstration tests
- Reliability for discrete state systems with cyclic missions periods
- On success runs of a fixed length in Bernoulli sequences: exact and asymptotic results
- On order statistics in waiting time for runs in Markov chains
- Reliabilities for (n, f, k (i, j)) and ⟨n, f, k (i, j)⟩ Systems
- The 6666 problem
- Corrected discrete approximations for the conditional and unconditional distributions of the continuous scan statistic
- Accelerated Simulation of Boltzmann-BGK Equations near the Diffusive Limit with Asymptotic-Preserving Multilevel Monte Carlo
- Context trees, variable length Markov chains and dynamical sources
- On occurrence of subpattern and method of gambling teams
- Waiting Times and Number of Appearances of Runs: A Unified Approach
- Distributions of pattern statistics in sparse Markov models
- The reliability of a generalized consecutive system
- Design of multiple run sampling plan
- Joint distributions of numbers of occurrences of a discrete pattern and weak convergence of an empirical process for the pattern
- Scan statistics for normal data with outliers
- Waiting time distribution for the emergence of superpatterns
- Exact and asymptotic results for pattern waiting times
- On a waiting time distribution in a sequence of Bernoulli trials
- Pseudo-binomial approximation to \((k_1, k_2)\)-runs
- A compound control chart for monitoring and controlling high quality processes
- On the length and the position of the minimum sequence containing all runs of ones in a Markovian binary sequence
- A New Similarity Measure and Its Use in Determining the Number of Clusters in a Multivariate Data Set
- Joint reliability of two consecutive-\((1, l)\) or \((2, k)\)-out-of-\((2, n)\): \(F\) type systems and its application in smart street light deployment
- Distributions of \((k_1,k_2,\dots ,k_m)\)-runs with multi-state trials
- The exact distribution of overlapping counting patterns associated with a sequence of homogeneous Markov-dependent multi-state trials: An application to secon
- Distributions of statistics describing concentration of runs in non homogeneous Markov-dependent trials
- Consecutive k and Related Models—A Survey
- Run and frequency quotas in a multi-state markov chain
- Generalizations of distributions related to \((k_1,k_2)\)-runs
- On the number of overflown urns and excess balls in an allocation model with limited urn capacity
- Joint distributions associated with patterns, successes and failures in a sequence of multi-state trials
- Distributions of Runs and Scans on Higher-Order Markov Trees
- Analytic combinatorics for computing seeding probabilities
- Approximation of sojourn-times via maximal couplings: motif frequency distributions
- An algorithm to compute the probability of a run in binary fourth-order Markovian trials.
- Time inhomogeneity in longest gap and longest run problems
- On success runs of length exceeded a threshold
- Reliabilities for (n,f,k) systems
- Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains
- Computation of exact probabilities associated with overlapping pattern occurrences
- On the distribution of the number of success runs in a continuous time Markov chain
- Convergence theorems for the lengths of consecutive successes of Markov Bernoulli sequences
- Chess, chance and conspiracy
- Waiting time problems for a two-dimensional pattern
- Distributions of patterns of two successes separated by a string of \(k-2\) failures
- Distribution of the length of the longest common subsequence of two multi-state biological sequences
- Distributions related to \((k_{1},k_{2})\) events
- Runs, scans and urn model distributions: A unified Markov chain approach
- On ordered series and later waiting time distributions in a sequence of Markov dependent multistate trials
- Useful inequalities for the longest run distribution
- Start-up demonstration tests with sparse connection
- Bounds for coherent reliability structures
- On the average run lengths of quality control schemes using a Markov chain approach
- Distribution of waiting time until the \(r\)th occurrence of a compound pattern
- Exact and approximate runs distributions
- On the distribution of runs of ones in binary strings
- On the joint distribution of runs in a sequence of multi-state trials
- A Markov-chain method for computing the run-length distribution of the self-starting cumulative sum scheme
- Waiting time for an almost perfect run and applications in statistical process control
- Distributions of successions of arbitrary multisets
- A self-exciting marked point process model for drought analysis
- Reliability analysis of \(k\)-out-of-\(n\):F balanced systems with multiple functional sectors
- Runs rules schemes for monitoring process variability
- Waiting time distributions of competing patterns in higher-order Markovian sequences
- Bonferroni-type inequalities for conditional scan statistics
- Reliability evaluation of generalised multi-state \(k\)-out-of-\(n\) systems based on FMCI approach
- Implied distributions in multiple change point problems
- Distributions associated with general runs and patterns in hidden Markov models
This page was built for publication: Distribution Theory of Runs: A Markov Chain Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4314909)
