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

DOI10.2307/3213511zbMath0493.60071OpenAlexW2332523405MaRDI QIDQ3956180

Daniel Thorburn, Gunnar Blom

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

renewal processwaiting time distributionleading numbersstopping sequence

Mathematics Subject Classification ID

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

Related Items (24)

Joint distributions associated with patterns, successes and failures in a sequence of multi-state trials ⋮ Waiting time problems for a two-dimensional pattern ⋮ A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials ⋮ 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 ⋮ The Number of Optimal Strategies in the Penney-Ante Game ⋮ Explicit distributional results in pattern formation ⋮ Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains ⋮ Faster than expected escape for a class of fully chaotic maps ⋮ 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 ⋮ Oscillation properties of expected stopping times and stopping probabilities for patterns consisting of consecutive states in Markov chains ⋮ Approximating the distributions of runs and patterns ⋮ Stopping Probabilities for Patterns in Markov Chains ⋮ On the mean number of trials until the last trials satisfy a given condition ⋮ Sharp error terms for return time statistics under mixing conditions ⋮ On Discrete Time Semi-Markov Chains and Applications in Words Occurrences ⋮ A Phase Transition for the Distribution of Matching Blocks ⋮ Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains ⋮ On occurrence of subpattern and method of gambling teams ⋮ Digital search trees and chaos game representation ⋮ 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?