On patterns in sequences of random events
From MaRDI portal
The paper investigates the avoidance of specific patterns in sequences of independent and Markovian trials. Introducing a Markov chain whose states correspond to the possible symbols from the alphabet and to their sequences from the beginning of the word we have to avoid, by using some matrix methods one determines the number of sequences of length \(n\) avoiding the pattern and evaluates the corresponding probabilities. As example one considers the possible configurations of length 3 in the Bernoulli trials.
Recommendations
- scientific article; zbMATH DE number 1959503
- Recursive events in random sequences
- On sequences of events with repetitions
- Detection of patterns within randomness
- On pattern frequency occurrences in a Markovian sequence
- Patterns in random permutations
- The occurrence of sequence patterns in ergodic Markov chains
- Exact probability of fixed patterns occurring in a random sequence
Cited in
(10)- On cyclic strings avoiding a pattern
- Stochastic analysis of minimal automata growth for generalized strings
- The Occurrence of Sequence Patterns in Repeated Dependent Experiments
- On sequences of events with repetitions
- scientific article; zbMATH DE number 1959503 (Why is no real title available?)
- scientific article; zbMATH DE number 3998861 (Why is no real title available?)
- scientific article; zbMATH DE number 2114230 (Why is no real title available?)
- scientific article; zbMATH DE number 5257691 (Why is no real title available?)
- On sequences of independent Bernoulli trials avoiding the pattern `11 1'
- Multiple pattern matching: a Markov chain approach
This page was built for publication: On patterns in sequences of random events
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295737)
