Pages that link to "Item:Q3956180"
From MaRDI portal
The following pages link to How many random digits are required until given sequences are obtained? (Q3956180):
Displaying 24 items.
- Approximating the distributions of runs and patterns (Q499758) (← links)
- On the mean number of trials until the last trials satisfy a given condition (Q584829) (← links)
- The occurrence of sequence patterns in ergodic Markov chains (Q791233) (← links)
- A martingale approach to scan statistics (Q816583) (← links)
- Sharp error terms for return time statistics under mixing conditions (Q1014064) (← links)
- On occurrence of subpattern and method of gambling teams (Q1039834) (← links)
- A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials (Q1094743) (← links)
- Explicit distributional results in pattern formation (Q1370998) (← links)
- Joint distributions associated with patterns, successes and failures in a sequence of multi-state trials (Q1881010) (← links)
- Waiting time problems for a two-dimensional pattern (Q1881011) (← links)
- Oscillation properties of expected stopping times and stopping probabilities for patterns consisting of consecutive states in Markov chains (Q2211941) (← links)
- Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains (Q2404176) (← links)
- Context Trees, Variable Length Markov Chains and Dynamical Sources (Q2906153) (← links)
- Faster than expected escape for a class of fully chaotic maps (Q2944626) (← links)
- On Discrete Time Semi-Markov Chains and Applications in Words Occurrences (Q3634538) (← links)
- A Phase Transition for the Distribution of Matching Blocks (Q4715263) (← links)
- The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach (Q4819503) (← links)
- The Number of Optimal Strategies in the Penney-Ante Game (Q4987405) (← links)
- Stopping Probabilities for Patterns in Markov Chains (Q5416558) (← links)
- Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains (Q5488994) (← links)
- Digital search trees and chaos game representation (Q5851009) (← links)
- Ranking graphs through hitting times of Markov chains (Q6074655) (← links)
- Construction of aggregation paradoxes through load-sharing models (Q6159384) (← links)
- On expected waiting time until given words appear in random sequence (Q6165363) (← links)
