Pages that link to "Item:Q1147437"
From MaRDI portal
The following pages link to The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain (Q1147437):
Displaying 27 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)
- Approximating the extreme right-hand tail probability for the distribution of the number of patterns in a sequence of multi-state trials (Q645617) (← links)
- Sooner and later waiting time problems for Markovian Bernoulli trials (Q689497) (← links)
- The occurrence of sequence patterns in ergodic Markov chains (Q791233) (← 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)
- Hitting times of sequences (Q1093250) (← 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)
- Waiting times and stopping probabilities for patterns in Markov chains (Q1747367) (← links)
- Cover times for Markov-generated binary sequences of length two (Q2192250) (← links)
- Oscillation properties of expected stopping times and stopping probabilities for patterns consisting of consecutive states in Markov chains (Q2211941) (← links)
- A note on the gambling team method (Q2446701) (← links)
- A note on occurrence of gapped patterns in i.i.d. Sequences (Q2462355) (← links)
- Approximation of sojourn-times via maximal couplings: motif frequency distributions (Q2510394) (← links)
- Patterns in Random Walks and Brownian Motion (Q2798575) (← links)
- Context Trees, Variable Length Markov Chains and Dynamical Sources (Q2906153) (← links)
- The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach (Q4819503) (← links)
- Stopping Probabilities for Patterns in Markov Chains (Q5416558) (← 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)
