On the public citation graph
A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
0 signed · 51 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.1007/bf00531434openalex-snapshot
Long repetitive patterns in random sequences
inferredcites →https://doi.org/10.1007/bf00537225openalex-snapshot
On the longest run of coincidences
inferredcites →https://doi.org/10.1007/bf02020027openalex-snapshot
The limit distribution of the length of the longest head-run
inferredcites →https://doi.org/10.1016/0016-0032(50)90714-9openalex-snapshot
An introduction to probability theory and its application
inferredcites →https://doi.org/10.1016/0097-3165(81)90005-4openalex-snapshot
String overlaps, pattern matching, and nontransitive games
inferredcites →https://doi.org/10.1016/0304-4149(81)90025-9openalex-snapshot
The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain
inferredcites →https://doi.org/10.1016/0304-4149(84)90012-7openalex-snapshot
The occurrence of sequence patterns in ergodic Markov chains
inferredcites →https://doi.org/10.1017/s0021900200037025openalex-snapshot
How many random digits are required until given sequences are obtained?
inferredcites →https://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
inferredcites →https://doi.org/10.1111/j.2517-6161.1984.tb01311.xopenalex-snapshot
Poisson Convergence for Dissociated Statistics
inferredcites →https://doi.org/10.1137/1126056openalex-snapshot
On the Length of the Longest Head-Run for a Markov Chain with Two States
inferredcites →https://doi.org/10.2307/2280517openalex-snapshot
An Introduction to Probability Theory and Its Application.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/andp.202300289openalex-snapshot
Semiconductor Emitters in Entropy Sources for Quantum Random Number Generation
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/s10955-006-9247-zopenalex-snapshot
String Matching and 1d Lattice Gases
inferred← citeshttps://doi.org/10.1007/s11538-005-9029-9openalex-snapshot
Some Probabilistic Results on the Nonrandomness of Simple Sequence Repeats in DNA Sequences
inferred← citeshttps://doi.org/10.1016/j.dam.2007.04.030openalex-snapshot
Comparing bacterial genomes from linear orders of patterns
inferred← citeshttps://doi.org/10.1017/s0001867800011915openalex-snapshot
Distribution of the number of words with a prescribed frequency and tests of randomness
inferred← citeshttps://doi.org/10.1017/s0001867800023983openalex-snapshot
Poisson approximations for runs and patterns of rare events
inferred← citeshttps://doi.org/10.1017/s0001867800025386openalex-snapshot
Improved Poisson approximations for word patterns
inferred← citeshttps://doi.org/10.1017/s0021900200001534openalex-snapshot
A Compound Poisson Approximation Inequality
inferred← citeshttps://doi.org/10.1017/s0021900200103353openalex-snapshot
Compound Poisson approximations for word patterns under Markovian hypotheses
inferred← citeshttps://doi.org/10.1023/a:1003170823986openalex-snapshot
Formulae and Recursions for the Joint Distribution of Success Runs of Several Lengths
inferred← citeshttps://doi.org/10.1023/a:1010042628865openalex-snapshot
On the Number of Appearances of a Word in a Sequence of I.I.D. Trials
inferred← citeshttps://doi.org/10.1051/ps:1997100openalex-snapshot
Compound Poisson approximation of word counts in DNA sequences
inferred← citeshttps://doi.org/10.1080/10629360600997371openalex-snapshot
Cumulative distribution function of a geometric Poisson distribution
inferred← citeshttps://doi.org/10.1088/2631-8695/ad9139openalex-snapshot
Enhancing security and randomness in cryptography and non-cryptographic applications with ORNA algorithm
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.1117/12.582255openalex-snapshot
An integrable low-cost hardware random number generator
inferred← citeshttps://doi.org/10.1117/12.620306openalex-snapshot
Exploiting metastability and thermal noise to build a reconfigurable hardware random number generator
inferred← citeshttps://doi.org/10.1137/s0040585x97984115openalex-snapshot
Joint Distribution of Pattern Frequencies and Multivariate Pòlya–Aeppli Law
inferred← citeshttps://doi.org/10.1186/1748-7188-1-17openalex-snapshot
Pattern statistics on Markov chains and sensitivity to parameter estimation
inferred← citeshttps://doi.org/10.1214/aoap/1015345355openalex-snapshot
Compound Poisson approximation: a user's guide
inferred← citeshttps://doi.org/10.1214/aoap/1034801248openalex-snapshot
Explicit distributional results in pattern formation
inferred← citeshttps://doi.org/10.12681/eadd/21605openalex-snapshot
Θεωρία ροών επιτυχιών και εφαρμογές
inferred← citeshttps://doi.org/10.1515/156939203322733273openalex-snapshot
Structural equivalence of s-tuples in random discrete sequences
inferred← citeshttps://doi.org/10.1515/dma-2022-0020openalex-snapshot
Formulas for the numbers of sequences containing a given pattern given number of times
inferred← citeshttps://doi.org/10.4213/dm1626openalex-snapshot
Формулы для чисел последовательностей, содержащих заданный шаблон заданное число раз
inferred← citeshttps://doi.org/10.4213/dm214openalex-snapshot
Структурная эквивалентность $s$-цепочек в случайных дискретных последовательностях
inferred← citeshttps://doi.org/10.4213/tvp2697openalex-snapshot
Совместное распределение частот цепочек и многомерный закон Пойа - Эпли
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95472openalex-snapshot
Scalability in extensible and heterogeneous storage systems
inferred← citeshttps://doi.org/10.6028/nist.sp.800-22openalex-snapshot
A statistical test suite for random and pseudorandom number generators for cryptographic applications
inferred← citeshttps://doi.org/10.6028/nist.sp.800-22r1aopenalex-snapshot
A statistical test suite for random and pseudorandom number generators for cryptographic applications
inferred← citeshttps://doi.org/10.83129/toubkal-14229openalex-snapshot
Conception et validation d'un régénérateur de suites binaires cryptographiquement sûres base sur les algorithmes évolutionnistes
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.