Pages that link to "Item:Q1146439"

The following pages link to A martingale approach to the study of occurrence of sequence patterns in repeated experiments (Q1146439):

Displayed 24 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)
• 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)
• Cover times for words in symmetric and nonsymmetric cases: A comparison (Q1917614) ‎ (← links)
• A note on occurrence of gapped patterns in i.i.d. Sequences (Q2462355) ‎ (← 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)
• 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)