Pages that link to "Item:Q2757073"
From MaRDI portal
The following pages link to Poisson approximation for the non-overlapping appearances of several words in Markov chains (Q2757073):
Displaying 14 items.
- Estimates of accuracy of the Poisson approximation for the distribution of number of runs of long string repetitions in a Markov chain (Q314184) (← links)
- Some results associated with the longest run in a strongly ergodic Markov chain (Q381064) (← links)
- Waiting times for clumps of patterns and for structured motifs in random sequences (Q876489) (← links)
- On the length of the longest run in a multi-state Markov chain. (Q1423235) (← links)
- Compound Poisson approximation: A user's guide (Q1872438) (← links)
- On the number of appearances of a word in a sequence of i. i. d. trials (Q1961835) (← links)
- Poisson approximation (Q2323908) (← links)
- Doob-Martin compactification of a Markov chain for growing random words sequentially (Q2359729) (← links)
- On the number of characters matchings in discrete random sequence controlled by Markov chain (Q2630508) (← links)
- Poisson approximation for the number of non-decreasing runs in Markov chains (Q3382024) (← links)
- Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain (Q3435393) (← links)
- COMPOUND POISSON APPROXIMATION OF THE NUMBER DISTRIBUTION FOR MONOTONE STRINGS OF FIXED LENGTH IN A RANDOM SEQUENCE (Q5150681) (← links)
- Improved Poisson approximations for word patterns (Q5286948) (← links)
- A Compound Poisson Approximation Inequality (Q5489007) (← links)
