On the public citation graph
Long repetitive patterns in random sequences
0 signed · 98 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1016/0097-3165(81)90005-4openalex-snapshot
String overlaps, pattern matching, and nontransitive games
inferredcites →https://doi.org/10.1137/1111022openalex-snapshot
A Combinatorial Identity and Its Application to the Problem Concerning the First Occurrence of a Rare Event
inferredcites →https://doi.org/10.2307/2314609openalex-snapshot
An Introduction to Probability Theory and Its Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.3230240207openalex-snapshot
Minimal‐distance routing for KYKLOS II
inferred← citeshttps://doi.org/10.1006/aama.1997.0555openalex-snapshot
Measures of Distinctness for Random Partitions and Compositions of an Integer
inferred← citeshttps://doi.org/10.1007/10719839_45openalex-snapshot
Run Statistics for Geometrically Distributed Random Variables
inferred← citeshttps://doi.org/10.1007/978-1-4612-0749-8_6openalex-snapshot
A Poisson Limit Theorem on the Number of Appearances of a Pattern in a Markov Chain
inferred← citeshttps://doi.org/10.1007/978-1-4612-4140-9_21openalex-snapshot
Waiting Times and Number of Appearances of Events in a Sequence of Discrete Random Variables
inferred← citeshttps://doi.org/10.1007/978-1-4684-6888-5_4openalex-snapshot
Applications of Symbolic Mathematics to Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-319-71504-9_28openalex-snapshot
Number of Pairs of Template Matchings in q-ary Tree with Randomly Marked Vertices
inferred← citeshttps://doi.org/10.1007/978-3-540-74126-8_23openalex-snapshot
On-Line Viterbi Algorithm for Analysis of Long Biological Sequences
inferred← citeshttps://doi.org/10.1007/978-94-009-3965-3_6openalex-snapshot
Problems and Results on Random Walks
inferred← citeshttps://doi.org/10.1007/bf00319109openalex-snapshot
A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
inferred← citeshttps://doi.org/10.1007/bf00320082openalex-snapshot
Erdős-Révész type bounds for the length of the longest run from a stationary mixing sequence
inferred← citeshttps://doi.org/10.1007/bf00532239openalex-snapshot
On the Erdös-Rényi theorem for random fields and sequences and its relationships with the theory of runs and spacings
inferred← citeshttps://doi.org/10.1007/bf00699107openalex-snapshot
An extreme value theory for long head runs
inferred← citeshttps://doi.org/10.1007/bf00970481openalex-snapshot
Rate of convergence in the problem of the longest head-run
inferred← citeshttps://doi.org/10.1007/bf01192057openalex-snapshot
Longest runs in a sequence ofm-dependent random variables
inferred← citeshttps://doi.org/10.1007/bf01876373openalex-snapshot
On long runs of heads and tails II
inferred← citeshttps://doi.org/10.1007/bf02924680openalex-snapshot
Regularities and irregularities in a random 0,1 sequence
inferred← citeshttps://doi.org/10.1007/s00236-013-0176-4openalex-snapshot
Avoiding cross-bifix-free binary words
inferred← citeshttps://doi.org/10.1007/s00362-021-01237-0openalex-snapshot
Understanding nonsense correlation between (independent) random walks in finite samples
inferred← citeshttps://doi.org/10.1007/s10998-024-00580-7openalex-snapshot
In memoriam Pál Révész (1934–2022)
inferred← citeshttps://doi.org/10.1016/0001-8708(85)90002-7openalex-snapshot
Matching rectangles in d-dimensions: Algorithms and laws of large numbers
inferred← citeshttps://doi.org/10.1016/0001-8708(85)90003-9openalex-snapshot
An Erdös-Rényi law with shifts
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90146-5openalex-snapshot
On sparse languages L such that LL = Σ
inferred← citeshttps://doi.org/10.1016/0167-6687(94)90790-0openalex-snapshot
Longest runs in coin tossing
inferred← citeshttps://doi.org/10.1016/0167-7152(84)90028-2openalex-snapshot
Asymptotic independence of ‘pure head’ stopping times
inferred← citeshttps://doi.org/10.1016/0167-7152(94)90137-6openalex-snapshot
On long runs of heads and tails
inferred← citeshttps://doi.org/10.1016/0304-4149(87)90013-5openalex-snapshot
Maximal success durations for a semi-Markov process
inferred← citeshttps://doi.org/10.1016/0895-7177(92)90166-iopenalex-snapshot
A bibliography on computational molecular biology and genetics
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50024-5openalex-snapshot
10.1016/b978-044488002-4/50024-5
inferred← citeshttps://doi.org/10.1016/j.disc.2006.07.023openalex-snapshot
Binary words excluding a pattern and proper Riordan arrays
inferred← citeshttps://doi.org/10.1016/j.jmaa.2017.09.018openalex-snapshot
The Hausdorff dimension of level sets described by Erdös–Rényi average
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.07.019openalex-snapshot
Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
inferred← citeshttps://doi.org/10.1016/s0167-7152(02)00432-7openalex-snapshot
On the length of the longest run in a multi-state Markov chain
inferred← citeshttps://doi.org/10.1016/s0169-7161(03)21014-2openalex-snapshot
Ch. 12. Applications of markov chains to the distribution theory of runs and patterns
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00641-2openalex-snapshot
Combinatorics of geometrically distributed random variables: run statistics
inferred← citeshttps://doi.org/10.1017/s0001867800016578openalex-snapshot
Counts of long aligned word matches among random letter sequences
inferred← citeshttps://doi.org/10.1017/s0001867800023983openalex-snapshot
Poisson approximations for runs and patterns of rare events
inferred← citeshttps://doi.org/10.1017/s0021900200029168openalex-snapshot
Renewal theory for several patterns
inferred← citeshttps://doi.org/10.1017/s0021900200041085openalex-snapshot
A limit theorem for the number of non-overlapping occurrences of a pattern in a sequence of independent trials
inferred← citeshttps://doi.org/10.1017/s0021900200041619openalex-snapshot
On some statistics connected with runs in Markov chains
inferred← citeshttps://doi.org/10.1017/s0021900200113415openalex-snapshot
Runs in coin tossing: a general approach for deriving distributions for functionals
inferred← citeshttps://doi.org/10.1073/pnas.1402621111openalex-snapshot
Higher-order dangers and precisely constructed taxa in models of randomness
inferred← citeshttps://doi.org/10.1080/00150517.1995.12429156openalex-snapshot
Geometric Distributions and Forbidden Subwords
inferred← citeshttps://doi.org/10.1080/07468342.1990.11973306openalex-snapshot
The Longest Run of Heads
inferred← citeshttps://doi.org/10.1080/17442508.2022.2030339openalex-snapshot
On longest consecutive patterns in Markov chains
inferred← citeshttps://doi.org/10.1089/10665270050081360openalex-snapshot
Probabilistic and Statistical Properties of Words: An Overview
inferred← citeshttps://doi.org/10.1089/10665270050081469openalex-snapshot
An Overview on the Distribution of Word Counts in Markov Chains
inferred← citeshttps://doi.org/10.1089/cmb.1997.4.35openalex-snapshot
Central Limit Theorem for Renewal Theory for Several Patterns
inferred← citeshttps://doi.org/10.1093/bioinformatics/btg309openalex-snapshot
Early bioinformatics: the birth of a discipline—a personal view
inferred← citeshttps://doi.org/10.1137/0406006openalex-snapshot
Exact Formulas for Multitype Run Statistics in a Random Ordering
inferred← citeshttps://doi.org/10.1137/1135015openalex-snapshot
The Occurrence of Sequence Patterns in Repeated Dependent Experiments
inferred← citeshttps://doi.org/10.1137/s0040585x97984115openalex-snapshot
Joint Distribution of Pattern Frequencies and Multivariate Pòlya–Aeppli Law
inferred← citeshttps://doi.org/10.1137/s0895480101390576openalex-snapshot
Exact Word-Run Statistics in Random Orderings
inferred← citeshttps://doi.org/10.1137/s0895480199363155openalex-snapshot
On the Multiplicity of Parts in a Random Composition of a Large Integer
inferred← citeshttps://doi.org/10.1142/s0129054193000055openalex-snapshot
MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES
inferred← citeshttps://doi.org/10.1214/aoap/1034801248openalex-snapshot
Explicit distributional results in pattern formation
inferred← citeshttps://doi.org/10.1214/aop/1176991491openalex-snapshot
Two Moments Suffice for Poisson Approximations: The Chen-Stein Method
inferred← citeshttps://doi.org/10.1214/aos/1176347615openalex-snapshot
The Erdos-Renyi Law in Distribution, for Coin Tossing and Sequence Matching
inferred← citeshttps://doi.org/10.1214/aos/1176350045openalex-snapshot
An Extreme Value Theory for Sequence Matching
inferred← citeshttps://doi.org/10.1239/jap/1445543844openalex-snapshot
Runs in coin tossing: a general approach for deriving distributions for functionals
inferred← citeshttps://doi.org/10.12681/eadd/21605openalex-snapshot
Θεωρία ροών επιτυχιών και εφαρμογές
inferred← citeshttps://doi.org/10.14279/depositonce-2481openalex-snapshot
Modeling and Analysis of Wireless Communication Systems using Automatic Retransmission Request Protocols
inferred← citeshttps://doi.org/10.1515/dma-2016-0012openalex-snapshot
On coincidences of tuples in a binary tree with random labels of vertices
inferred← citeshttps://doi.org/10.1515/dma-2018-0026openalex-snapshot
On coincidences of tuples in a q-ary tree with random labels of vertices
inferred← citeshttps://doi.org/10.17169/refubium-8791openalex-snapshot
Statistics for transcription factor binding sites
inferred← citeshttps://doi.org/10.2298/aadm1000010kopenalex-snapshot
Staircase words and Chebyshev polynomials
inferred← citeshttps://doi.org/10.2307/3214798openalex-snapshot
Asymptotic reliability of consecutive k-out-of-n systems
inferred← citeshttps://doi.org/10.3233/fi-2012-687openalex-snapshot
Pattern 1j+10j Avoiding Binary Words
inferred← citeshttps://doi.org/10.3233/fi-2017-1595openalex-snapshot
Pattern Avoiding Languages and Recurrence Relations Interpretation
inferred← citeshttps://doi.org/10.4204/eptcs.63.9openalex-snapshot
Pattern 1^j0^i avoiding binary words
inferred← citeshttps://doi.org/10.4213/dm1346openalex-snapshot
Повторения цепочек на бинарном деревесо случайными метками вершин
inferred← citeshttps://doi.org/10.4213/dm1537openalex-snapshot
Повторения цепочек на $q$-ичном дереве со случайными метками вершин
inferred← citeshttps://doi.org/10.4213/mvk383openalex-snapshot
Об асимптотической нормальности в задаче о повторениях цепочек в помеченном полном дереве
inferred← citeshttps://doi.org/10.4213/mvk431openalex-snapshot
Условия асимптотической нормальности числа кратных повторений цепочек в помеченных полных деревьях и лесах
inferred← citeshttps://doi.org/10.4213/tvp2697openalex-snapshot
Совместное распределение частот цепочек и многомерный закон Пойа - Эпли
inferred← citeshttps://doi.org/10.4236/ojdm.2013.31002openalex-snapshot
Counting Types of Runs in Classes of Arborescent Words
inferred← citeshttps://doi.org/10.46298/dmtcs.2125openalex-snapshot
Bootstrapping and double-exponential limit laws
inferred← citeshttps://doi.org/10.48550/arxiv.1103.5689openalex-snapshot
Binary words avoiding a pattern and marked succession rule
inferred← citeshttps://doi.org/10.48550/arxiv.1210.7620openalex-snapshot
Generation of binary words avoiding alternating patterns
inferred← citeshttps://doi.org/10.48550/arxiv.1405.1803openalex-snapshot
Asymptotic estimate for the polynomial coefficients
inferred← citeshttps://doi.org/10.48550/arxiv.1603.08500openalex-snapshot
Dichotomic random number generators
inferred← citeshttps://doi.org/10.48550/arxiv.1811.04541openalex-snapshot
On the length of the longest consecutive switches
inferred← citeshttps://doi.org/10.5486/pmd.2010.4642openalex-snapshot
How short might be the longest run in a dynamical coin tossing sequence
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.