How many random digits are required until given sequences are obtained?

DOI10.2307/3213511MaRDI QIDQ3956180zbMATH OpenOpenAlexFDO

Authors Gunnar Blom, Daniel Thorburn

Publication date 1982

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3213511

zbMATH Keywords

leading numbersrenewal processstopping sequencewaiting time distribution

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cited in

(25)

• Sharp error terms for return time statistics under mixing conditions
• On occurrence of subpattern and method of gambling teams
• A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
• Explicit distributional results in pattern formation
• Joint distributions associated with patterns, successes and failures in a sequence of multi-state trials
• Waiting time problems for a two-dimensional pattern
• Oscillation properties of expected stopping times and stopping probabilities for patterns consisting of consecutive states in Markov chains
• Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains
• Context trees, variable length Markov chains and dynamical sources
• Faster than expected escape for a class of fully chaotic maps
• On Discrete Time Semi-Markov Chains and Applications in Words Occurrences
• A Phase Transition for the Distribution of Matching Blocks
• The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach
• The number of optimal strategies in the Penney-Ante game
• Approximating the distributions of runs and patterns
• Stopping Probabilities for Patterns in Markov Chains
• Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains
• On the mean number of trials until the last trials satisfy a given condition
• Digital search trees and chaos game representation
• Ranking graphs through hitting times of Markov chains
• Construction of aggregation paradoxes through load-sharing models
• On expected waiting time until given words appear in random sequence
• The generalized alice HH vs Bob HT problem
• The occurrence of sequence patterns in ergodic Markov chains
• A martingale approach to scan statistics

This page was built for publication: How many random digits are required until given sequences are obtained?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3956180)