On occurrence of subpattern and method of gambling teams

DOI10.1007/s10463-006-0082-4zbMath1178.60032OpenAlexW2077862497MaRDI QIDQ1039834

Vladimir Pozdnyakov

Publication date: 23 November 2009

Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10463-006-0082-4

Mathematics Subject Classification ID

Martingales with discrete parameter (60G42) Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40) Approximations to statistical distributions (nonasymptotic) (62E17)

Related Items (1)

Patterns generated by \(m\)th-order Markov chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A martingale approach to scan statistics
• 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
• Periods in strings
• On generating functions of waiting time problems for sequence patterns of discrete random variables
• Distributions of numbers of failures and successes until the first consecutive \(k\) successes
• Explicit distributional results in pattern formation
• Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials
• Number of occurrences of subpattern until the first appearance of a pattern and geometric distribution.
• Exact distribution of the distances between any occurrences of a set of words
• Waiting times for patterns in a sequence of multistate trials
• Testing Randomness: A Suite of Statistical Procedures
• On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials
• The Occurrence of Sequence Patterns in Repeated Dependent Experiments
• Renewal theory for several patterns
• Reliability of Consecutive-k-out-of-n:F Systems with (k-1)-step Markov Dependence
• Markov renewal processes, counters and repeated sequences in Markov chains
• How many random digits are required until given sequences are obtained?
• Probability with Martingales
• Explicit Distributional Results In Pattern Formation II
• Distribution Theory of Runs: A Markov Chain Approach
• Sooner and later waiting time problems for patterns in Markov dependent trials
• On some waiting time problems
• Distribution of the scan statistic for a sequence of bistate trials
• Distribution of the number of words with a prescribed frequency and tests of randomness
• The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach
• Waiting Times for Patterns and a Method of Gambling Teams
• Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains
• Distributions of the numbers of failures and successes in a waiting time problem

This page was built for publication: On occurrence of subpattern and method of gambling teams