Pages that link to "Item:Q1370998"

The following pages link to Explicit distributional results in pattern formation (Q1370998):

Displaying 24 items.

• Approximation for counts of 2-runs in a two state Markov chain (Q381060) (← links)
• Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source (Q384993) (← links)
• Approximation for counts of head runs (Q547351) (← links)
• A martingale approach to scan statistics (Q816583) (← links)
• Waiting time and complexity for matching patterns with automata (Q1014407) (← links)
• On occurrence of subpattern and method of gambling teams (Q1039834) (← links)
• Waiting time problem for an almost perfect match. (Q1423102) (← links)
• On run statistics for binary trials (Q1577321) (← links)
• Markov binomial distribution of order \(k\) and its applications (Q1685221) (← links)
• Joint distributions associated with patterns, successes and failures in a sequence of multi-state trials (Q1881010) (← links)
• Compound Poisson approximation for counts of rare patterns in Markov chains and extreme sojourns in birth-death chains. (Q1884831) (← links)
• Clustering genomic words in human DNA using peaks and trends of distributions (Q2183652) (← links)
• Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains (Q2404176) (← links)
• Distributions associated with \((k_1,k_2)\) events on semi-Markov binary trials (Q2434712) (← links)
• Stopping Markov processes and first path on graphs (Q2496876) (← links)
• Reliability computing method for generalized \(k\)-out-of-\(n\) system (Q2628367) (← links)
• Context Trees, Variable Length Markov Chains and Dynamical Sources (Q2906153) (← links)
• On the First <i>k</i> Moments of the Random Count of a Pattern in a Multistate Sequence Generated by a Markov Source (Q3067851) (← links)
• The behavior of a Markov network with respect to an absorbing class: the target algorithm (Q3398586) (← links)
• A general approach to the integral functionals of epidemic processes (Q4684961) (← links)
• The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach (Q4819503) (← links)
• Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata (Q5459921) (← links)
• Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains (Q5488994) (← links)
• Digital search trees and chaos game representation (Q5851009) (← links)