Long repetitive patterns in random sequences
From MaRDI portal
Cites work
- A Combinatorial Identity and Its Application to the Problem Concerning the First Occurrence of a Rare Event
- scientific article; zbMATH DE number 3655074 (Why is no real title available?)
- scientific article; zbMATH DE number 3704596 (Why is no real title available?)
- scientific article; zbMATH DE number 3564005 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3327849 (Why is no real title available?)
- Maximal Prefix-Synchronized Codes
- On a new law of large numbers
- On sequences of 'pure heads'
- Periods in strings
- String overlaps, pattern matching, and nontransitive games
Cited in
(37)- Matching rectangles in d-dimensions: Algorithms and laws of large numbers
- An Erdős-Rényi law with shifts
- An extreme value theory for long head runs
- Erdős-Révész type bounds for the length of the longest run from a stationary mixing sequence
- Maximal success durations for a semi-Markov process
- A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
- Rate of convergence in the problem of the longest head-run
- Longest runs in a sequence of \(m\)-dependent random variables
- On long runs of heads and tails
- On long runs of heads and tails. II
- On sparse languages \(L\) such that \(LL= \Sigma^*\)
- A note on randomness
- Explicit distributional results in pattern formation
- Measures of distinctness for random partitions and compositions of an integer
- Combinatorics of geometrically distributed random variables: Run statistics
- On the length of the longest run in a multi-state Markov chain.
- The Hausdorff dimension of level sets described by Erdős-Rényi average
- On coincidences of tuples in a \(q\)-ary tree with random labels of vertices
- Longest runs in coin tossing
- Understanding nonsense correlation between (independent) random walks in finite samples
- Avoiding cross-bifix-free binary words
- Higher-order dangers and precisely constructed taxa in models of randomness
- On coincidences of tuples in a binary tree with random labels of vertices
- On the Erdös-Rényi theorem for random fields and sequences and its relationships with the theory of runs and spacings
- Runs in coin tossing: a general approach for deriving distributions for functionals
- Regularities and irregularities in a random 0,1 sequence
- Lucasnomial Fuss-Catalan numbers and related divisibility questions
- Algebraic generating functions for languages avoiding Riordan patterns
- On longest consecutive patterns in Markov chains
- On the asymptotic normality in the problem on the tuples repetitions in a marked complete tree
- Asymptotic estimate for the multinomial coefficients
- Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
- Asymptotic independence of 'pure head' stopping times
- Conditions for asymptotic normality of the number of multiple repetitions of chains in marked complete trees and forests;Условия асимптотической нормальности числа кратных повторений цепочек в помеченных полных деревьях и лесах
- Asymptotic normality of number of multiple coincidences of chains in complete q-ary trees and forests with randomly marked vertices
- On the evolution of random integer compositions
- Binary words excluding a pattern and proper Riordan arrays
This page was built for publication: Long repetitive patterns in random sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3859018)