Long repetitive patterns in random sequences
From MaRDI portal
Publication:3859018
DOI10.1007/BF00531434zbMath0424.60036OpenAlexW2087456401WikidataQ104672899 ScholiaQ104672899MaRDI QIDQ3859018
Andrew M. Odlyzko, Leonidas J. Guibas
Publication date: 1980
Published in: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00531434
Related Items
Erdős-Révész type bounds for the length of the longest run from a stationary mixing sequence ⋮ Understanding nonsense correlation between (independent) random walks in finite samples ⋮ On long runs of heads and tails. II ⋮ On sparse languages \(L\) such that \(LL= \Sigma^*\) ⋮ A note on randomness ⋮ Runs in coin tossing: a general approach for deriving distributions for functionals ⋮ 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 ⋮ Avoiding cross-bifix-free binary words ⋮ Longest runs in coin tossing ⋮ On longest consecutive patterns in Markov chains ⋮ On coincidences of tuples in a binary tree with random labels of vertices ⋮ Unnamed Item ⋮ Об асимптотической нормальности в задаче о повторениях цепочек в помеченном полном дереве ⋮ Explicit distributional results in pattern formation ⋮ Asymptotic independence of 'pure head' stopping times ⋮ Measures of distinctness for random partitions and compositions of an integer ⋮ Binary words excluding a pattern and proper Riordan arrays ⋮ The Hausdorff dimension of level sets described by Erdős-Rényi average ⋮ Regularities and irregularities in a random 0,1 sequence ⋮ Combinatorics of geometrically distributed random variables: Run statistics ⋮ Conditions for asymptotic normality of the number of multiple repetitions of chains in marked complete trees and forests;Условия асимптотической нормальности числа кратных повторений цепочек в помеченных полных деревьях и лесах ⋮ Higher-order dangers and precisely constructed taxa in models of randomness ⋮ On the length of the longest run in a multi-state Markov chain. ⋮ Rate of convergence in the problem of the longest head-run ⋮ Longest runs in a sequence of \(m\)-dependent random variables ⋮ On coincidences of tuples in a \(q\)-ary tree with random labels of vertices ⋮ Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern ⋮ On the Erdös-Rényi theorem for random fields and sequences and its relationships with the theory of runs and spacings ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On long runs of heads and tails ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- String overlaps, pattern matching, and nontransitive games
- Periods in strings
- On sequences of 'pure heads'
- On a new law of large numbers
- Maximal Prefix-Synchronized Codes
- A Combinatorial Identity and Its Application to the Problem Concerning the First Occurrence of a Rare Event
