Explicit distributional results in pattern formation
From MaRDI portal
Publication:1370998
DOI10.1214/aoap/1034801248zbMath0893.60005OpenAlexW2081523148MaRDI QIDQ1370998
Anthony G. Pakes, Valeri T. Stefanov
Publication date: 10 August 1998
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1034801248
Multivariate distribution of statistics (62H10) Characteristic functions; other transforms (60E10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Stopping times; optimal stopping problems; gambling theory (60G40) Discrete mathematics in relation to computer science (68R99)
Related Items
Joint distributions associated with patterns, successes and failures in a sequence of multi-state trials ⋮ Compound Poisson approximation for counts of rare patterns in Markov chains and extreme sojourns in birth-death chains. ⋮ Reliability computing method for generalized \(k\)-out-of-\(n\) system ⋮ Context Trees, Variable Length Markov Chains and Dynamical Sources ⋮ The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach ⋮ Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains ⋮ Approximation for counts of 2-runs in a two state Markov chain ⋮ Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source ⋮ Clustering genomic words in human DNA using peaks and trends of distributions ⋮ Markov binomial distribution of order \(k\) and its applications ⋮ Distributions associated with \((k_1,k_2)\) events on semi-Markov binary trials ⋮ Waiting time problem for an almost perfect match. ⋮ Approximation for counts of head runs ⋮ Stopping Markov processes and first path on graphs ⋮ A general approach to the integral functionals of epidemic processes ⋮ How to Reduce Unnecessary Noise in Targeted Networks ⋮ On the First k Moments of the Random Count of a Pattern in a Multistate Sequence Generated by a Markov Source ⋮ Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata ⋮ Waiting time and complexity for matching patterns with automata ⋮ The behavior of a Markov network with respect to an absorbing class: the target algorithm ⋮ Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains ⋮ On occurrence of subpattern and method of gambling teams ⋮ On run statistics for binary trials ⋮ Digital search trees and chaos game representation ⋮ A martingale approach to scan statistics
Cites Work
- A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
- On binomial distributions of order k
- A martingale approach to the study of occurrence of sequence patterns in repeated experiments
- The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain
- String overlaps, pattern matching, and nontransitive games
- Distributions of numbers of failures and successes until the first consecutive \(k\) successes
- Success runs of length \(k\) in Markov dependent trials
- Joint distributions of numbers of success-runs and failures until the first consecutive \(k\) successes
- Explicit limit results for minimal sufficient statistics and maximum likelihood estimators in some Markov processes: Exponential families approach
- Compound Poisson approximation of word counts in DNA sequences
- The Occurrence of Sequence Patterns in Repeated Dependent Experiments
- Renewal theory for several patterns
- Markov renewal processes, counters and repeated sequences in Markov chains
- Long repetitive patterns in random sequences
- Conditionality resolutions
- How many random digits are required until given sequences are obtained?
- Distribution Theory of Runs: A Markov Chain Approach
- Improved Poisson approximations for word patterns
- The Distribution Theory of Runs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
