Pages that link to "Item:Q1146439"
From MaRDI portal
The following pages link to A martingale approach to the study of occurrence of sequence patterns in repeated experiments (Q1146439):
Displaying 43 items.
- 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)
- On the fair coin tossing process (Q796174) (← links)
- A martingale approach to scan statistics (Q816583) (← links)
- Multiple pattern matching: a Markov chain approach (Q938109) (← links)
- On occurrence of patterns in Markov chains: Method of gambling teams (Q952874) (← links)
- Patterns generated by \(m\)th-order Markov chains (Q984004) (← links)
- On occurrence of subpattern and method of gambling teams (Q1039834) (← links)
- Large deviation results for waiting times in repeated experiments (Q1063927) (← links)
- On the expected time of the first occurrence of every k bit long patterns in the symmetric Bernoulli process (Q1086903) (← links)
- Hitting times of sequences (Q1093250) (← links)
- Asymptotic independence of maximum waiting times for increasing alphabet (Q1203462) (← links)
- How long does it take to see a flat Brownian path on the average? (Q1210124) (← links)
- On the waiting time till each of some given patterns occurs as a run (Q1263859) (← links)
- Covering with blocks in the non-symmetric case (Q1345083) (← links)
- On pattern occurrences in a random text (Q1351627) (← links)
- Explicit distributional results in pattern formation (Q1370998) (← links)
- A unified approach to word occurrence probabilities (Q1585335) (← links)
- Waiting times and stopping probabilities for patterns in Markov chains (Q1747367) (← links)
- Cover times for words in symmetric and nonsymmetric cases: A comparison (Q1917614) (← links)
- Oscillation properties of expected stopping times and stopping probabilities for patterns consisting of consecutive states in Markov chains (Q2211941) (← links)
- Stochastic precedence and minima among dependent variables (Q2241504) (← links)
- Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains (Q2404176) (← links)
- A note on the gambling team method (Q2446701) (← links)
- A note on occurrence of gapped patterns in i.i.d. Sequences (Q2462355) (← links)
- Patterns in Random Walks and Brownian Motion (Q2798575) (← links)
- Context Trees, Variable Length Markov Chains and Dynamical Sources (Q2906153) (← links)
- (Q3387506) (← links)
- Maximum Waiting Times are Asymptotically Independent (Q4291202) (← links)
- The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach (Q4819503) (← links)
- First Occurrence in Pairs of Long Words: A Penney-ante Conjecture of Pevzner (Q4862748) (← links)
- The Number of Optimal Strategies in the Penney-Ante Game (Q4987405) (← links)
- Learning Temporal Structures of Random Patterns by Generating Functions (Q5056983) (← links)
- From Iteration to System Failure: Characterizing the FITness of Periodic Weakly-Hard Systems (Q5089107) (← links)
- The 6666 Problem (Q5278069) (← links)
- Stopping Probabilities for Patterns in Markov Chains (Q5416558) (← links)
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata (Q5459921) (← links)
- Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains (Q5488994) (← links)
- Rarity and exponentiality: an extension of Keilson's theorem, with applications (Q5697591) (← links)
- Digital search trees and chaos game representation (Q5851009) (← links)
- Predictive control of linear discrete-time Markovian jump systems by learning recurrent patterns (Q6136143) (← links)
- Construction of aggregation paradoxes through load-sharing models (Q6159384) (← links)
- On expected waiting time until given words appear in random sequence (Q6165363) (← links)
