Explicit distributional results in pattern formation
Characteristic functions; other transforms (60E10) Stopping times; optimal stopping problems; gambling theory (60G40) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Multivariate distribution of statistics (62H10) Discrete mathematics in relation to computer science (68R99)
The concept of runs, and more generally patterns, has been used in various areas. A new and unified approach is presented for constructing joint generating functions for quantities of interest associated with pattern formation in binary sequences. The methodology presented in this paper is based on first imbedding the problem into a more general one for an appropriate finite-state Markov chain with one absorbing state, and second, treating that chain by the tools of exponential families. The first step of imbedding the problem into a similar one is natural and it has been used earlier while the second step based on exponential families is new for this area. The technology presented in this article is general enough to cover all existing results in this direction for binary sequences as well as to provide explicit expressions for some patterns which were not available earlier.
- Explicit Distributional Results In Pattern Formation II
- Pattern formation in bounded spatial domains
- Exact solutions for pattern formation in a reaction-diffusion system
- scientific article; zbMATH DE number 66629
- Pattern formation in reaction-diffusion systems
- Exact solutions of one pattern formation model
- A new two-mode fermion coherent state representation
- Pattern formations and spatial entropy for spatially discrete diffusion equations
- A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
- A martingale approach to the study of occurrence of sequence patterns in repeated experiments
- Compound Poisson approximation of word counts in DNA sequences
- Conditionality resolutions
- Distribution Theory of Runs: A Markov Chain Approach
- Distributions of numbers of failures and successes until the first consecutive k successes
- Explicit limit results for minimal sufficient statistics and maximum likelihood estimators in some Markov processes: Exponential families approach
- How many random digits are required until given sequences are obtained?
- scientific article; zbMATH DE number 44577 (Why is no real title available?)
- scientific article; zbMATH DE number 192942 (Why is no real title available?)
- scientific article; zbMATH DE number 3602484 (Why is no real title available?)
- scientific article; zbMATH DE number 635762 (Why is no real title available?)
- scientific article; zbMATH DE number 806875 (Why is no real title available?)
- scientific article; zbMATH DE number 3059214 (Why is no real title available?)
- Improved Poisson approximations for word patterns
- Joint distributions of numbers of success-runs and failures until the first consecutive \(k\) successes
- Long repetitive patterns in random sequences
- Markov renewal processes, counters and repeated sequences in Markov chains
- On binomial distributions of order k
- Renewal theory for several patterns
- String overlaps, pattern matching, and nontransitive games
- Success runs of length \(k\) in Markov dependent trials
- The Distribution Theory of Runs
- The Occurrence of Sequence Patterns in Repeated Dependent Experiments
- The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain
- Waiting time and complexity for matching patterns with automata
- On occurrence of subpattern and method of gambling teams
- Waiting time problem for an almost perfect match.
- On run statistics for binary trials
- Markov binomial distribution of order k and its applications
- 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.
- Clustering genomic words in human DNA using peaks and trends of distributions
- Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains
- Distributions associated with \((k_1,k_2)\) events on semi-Markov binary trials
- Stopping Markov processes and first path on graphs
- Reliability computing method for generalized \(k\)-out-of-\(n\) system
- Distributions of runs revisited
- Context trees, variable length Markov chains and dynamical sources
- On the First k Moments of the Random Count of a Pattern in a Multistate Sequence Generated by a Markov Source
- The behavior of a Markov network with respect to an absorbing class: the target algorithm
- How to Reduce Unnecessary Noise in Targeted Networks
- 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
- Explicit Distributional Results In Pattern Formation II
- A general approach to the integral functionals of epidemic processes
- The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
- Approximation for counts of head runs
- Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains
- Distribution of Runs and Longest Runs
- Digital search trees and chaos game representation
- Computation of exact probabilities associated with overlapping pattern occurrences
- Penney's game odds from no-arbitrage
- A singular dispersion relation arising in a caricature of a model for morphogenesis
- A martingale approach to scan statistics
This page was built for publication: Explicit distributional results in pattern formation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370998)
