On the public citation graph

The Occurrence of Sequence Patterns in Repeated Dependent Experiments

0 signed · 57 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.
Claim with ORCID
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.
See reference health

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.1016/0097-3165(81)90005-4openalex-snapshot
String overlaps, pattern matching, and nontransitive games
inferredcites →https://doi.org/10.1016/0097-3165(81)90038-8openalex-snapshot
Periods in strings
inferredcites →https://doi.org/10.1016/0167-7152(84)90028-2openalex-snapshot
Asymptotic independence of ‘pure head’ stopping times
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/s0021900200028357openalex-snapshot
On the mean number of random digits until a given sequence occurs
inferredcites →https://doi.org/10.1017/s0021900200029168openalex-snapshot
Renewal theory for several patterns
inferredcites →https://doi.org/10.1017/s0021900200036548openalex-snapshot
Success runs in a two-state Markov chain
inferredcites →https://doi.org/10.1017/s0021900200037025openalex-snapshot
How many random digits are required until given sequences are obtained?
inferredcites →https://doi.org/10.1137/0135034openalex-snapshot
Maximal Prefix-Synchronized Codes
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.1137/1119017openalex-snapshot
Limit Distributions of Random Variables Associated with Long Duplications in a Sequence of Independent Trials
inferredcites →https://doi.org/10.1137/1122063openalex-snapshot
On the Distribution of the Time up to the First Occurrence of a Given Number of Different $\ell $-Tuple Series
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.1214/aop/1176994578openalex-snapshot
A Martingale Approach to the Study of Occurrence of Sequence Patterns in Repeated Experiments

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118150467.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/11496656_31openalex-snapshot
Assessing the Significance of Sets of Words
inferred← citeshttps://doi.org/10.1007/3-540-45727-5_9openalex-snapshot
Computational Complexity of Word Counting
inferred← citeshttps://doi.org/10.1007/978-0-8176-4749-0_16openalex-snapshot
Occurrence of Patterns and Motifs in Random Strings
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-4613-3635-8_14openalex-snapshot
Pattern Recognition in Markov Chains
inferred← citeshttps://doi.org/10.1007/bf00052332openalex-snapshot
Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials
inferred← citeshttps://doi.org/10.1007/bf02506876openalex-snapshot
A martingale approach to scan statistics
inferred← citeshttps://doi.org/10.1007/s10463-006-0082-4openalex-snapshot
On occurrence of subpattern and method of gambling teams
inferred← citeshttps://doi.org/10.1007/s10463-007-0140-6openalex-snapshot
On waiting time distributions associated with compound patterns in a sequence of multi-state trials
inferred← citeshttps://doi.org/10.1007/s10955-006-9247-zopenalex-snapshot
String Matching and 1d Lattice Gases
inferred← citeshttps://doi.org/10.1007/s11766-018-3522-zopenalex-snapshot
Waiting times and stopping probabilities for patterns in Markov chains
inferred← citeshttps://doi.org/10.1016/0167-7152(93)90068-topenalex-snapshot
How long does it take to see a flat Brownian path on the average?
inferred← citeshttps://doi.org/10.1016/j.dam.2010.12.023openalex-snapshot
Occurrence of structured motifs in random sequences: Arbitrary number of boxes
inferred← citeshttps://doi.org/10.1017/s0001867800001634openalex-snapshot
Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain
inferred← citeshttps://doi.org/10.1017/s0001867800025386openalex-snapshot
Improved Poisson approximations for word patterns
inferred← citeshttps://doi.org/10.1017/s0021900200001418openalex-snapshot
Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains
inferred← citeshttps://doi.org/10.1017/s0021900200004083openalex-snapshot
Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
inferred← citeshttps://doi.org/10.1017/s002190020001024xopenalex-snapshot
Stopping Probabilities for Patterns in Markov Chains
inferred← citeshttps://doi.org/10.1017/s0021900200015977openalex-snapshot
On some waiting time problems
inferred← citeshttps://doi.org/10.1017/s0021900200020179openalex-snapshot
The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach
inferred← citeshttps://doi.org/10.1017/s0021900200022270openalex-snapshot
Sooner and later waiting time problems for patterns in Markov dependent trials
inferred← citeshttps://doi.org/10.1017/s0021900200103353openalex-snapshot
Compound Poisson approximations for word patterns under Markovian hypotheses
inferred← citeshttps://doi.org/10.1017/s0021900200103717openalex-snapshot
Recursive relations for the distribution of waiting times in a Markov chain
inferred← citeshttps://doi.org/10.1017/s096354830100476xopenalex-snapshot
Poisson Approximation for the Non-Overlapping Appearances of Several Words in Markov Chains
inferred← citeshttps://doi.org/10.1017/s0963548399003806openalex-snapshot
On a Conjecture by Eriksson Concerning Overlap in Strings
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.1023/a:1014633825822openalex-snapshot
Exact Distribution of the Distances between Any Occurrences of a Set of Words
inferred← citeshttps://doi.org/10.1080/00029890.2006.11920287openalex-snapshot
Waiting Times for Patterns and a Method of Gambling Teams
inferred← citeshttps://doi.org/10.1080/03610920701713328openalex-snapshot
On Discrete Time Semi-Markov Chains and Applications in Words Occurrences
inferred← citeshttps://doi.org/10.1109/access.2021.3105607openalex-snapshot
Fast Algorithms for Computing the Statistics of Pattern Matching
inferred← citeshttps://doi.org/10.1109/sequen.1997.666920openalex-snapshot
On the approximate pattern occurrences in a text
inferred← citeshttps://doi.org/10.1186/1748-7188-2-13openalex-snapshot
Exact p-value calculation for heterotypic clusters of regulatory motifs and its application in computational annotation of cis-regulatory modules
inferred← citeshttps://doi.org/10.1214/aoap/1034801248openalex-snapshot
Explicit distributional results in pattern formation
inferred← citeshttps://doi.org/10.1239/jap/1032374240openalex-snapshot
Exact distribution of word occurrences in a random sequence of letters
inferred← citeshttps://doi.org/10.1239/jap/1208358964openalex-snapshot
Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
inferred← citeshttps://doi.org/10.1515/156939203322733273openalex-snapshot
Structural equivalence of s-tuples in random discrete sequences
inferred← citeshttps://doi.org/10.4213/dm214openalex-snapshot
Структурная эквивалентность $s$-цепочек в случайных дискретных последовательностях
inferred← citeshttps://doi.org/10.46298/dmtcs.382openalex-snapshot
Waiting time distributions for pattern occurrence in a constrained sequence
inferred← citeshttps://doi.org/10.70675/90894381z9e79z467az9003z458d5a422318openalex-snapshot
Analyse probabiliste, étude combinatoire et estimation paramétrique pour une classe de modèles de croissance de plantes avec organogenèse stochastique
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.