On the public citation graph
Структурная эквивалентность $s$-цепочек в случайных дискретных последовательностях
0 signed · 34 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/bf00319109openalex-snapshot
A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
inferredcites →https://doi.org/10.1007/bf00699107openalex-snapshot
An extreme value theory for long head runs
inferredcites →https://doi.org/10.1007/bf01953974openalex-snapshot
On the number of occurrences of sequence patterns
inferredcites →https://doi.org/10.1017/s0001867800011915openalex-snapshot
Distribution of the number of words with a prescribed frequency and tests of randomness
inferredcites →https://doi.org/10.1017/s0001867800016578openalex-snapshot
Counts of long aligned word matches among random letter sequences
inferredcites →https://doi.org/10.1017/s0001867800016840openalex-snapshot
A note on repeated sequences in Markov chains
inferredcites →https://doi.org/10.1017/s0021900200023585openalex-snapshot
The first repetition of a pattern in a symmetric Bernoulli sequence
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.1093/oso/9780198522355.001.0001openalex-snapshot
Poisson Approximation
inferredcites →https://doi.org/10.1109/tit.1976.1055501openalex-snapshot
On the Complexity of Finite Sequences
inferredcites →https://doi.org/10.1137/1135015openalex-snapshot
The Occurrence of Sequence Patterns in Repeated Dependent Experiments
inferredcites →https://doi.org/10.1214/aop/1176988492openalex-snapshot
Critical Phenomena for Sequence Matching with Scoring
inferredcites →https://doi.org/10.1214/aop/1176988493openalex-snapshot
Limit Distribution of Maximal Non-Aligned Two-Sequence Segmental Score
inferredcites →https://doi.org/10.1214/aop/1176991772openalex-snapshot
Maximal Length of Common Words Among Random Letter Sequences
inferredcites →https://doi.org/10.1214/aop/1176992808openalex-snapshot
Critical Phenomena in Sequence Matching
inferredcites →https://doi.org/10.1214/aos/1176347615openalex-snapshot
The Erdos-Renyi Law in Distribution, for Coin Tossing and Sequence Matching
inferredcites →https://doi.org/10.1214/aos/1176350045openalex-snapshot
An Extreme Value Theory for Sequence Matching
inferredcites →https://doi.org/10.4213/dm233openalex-snapshot
Предельные распределения числа наборов $H$-эквивалентных отрезков в равновероятной полиномиальной схеме серий
inferredcites →https://doi.org/10.4213/dm259openalex-snapshot
Об асимптотических свойствах распределения числа пар $H$-связанных цепочек
inferredcites →https://doi.org/10.4213/dm312openalex-snapshot
Повторения с точностью до перестановок, образующих латинский прямоугольник
inferredcites →https://doi.org/10.4213/dm345openalex-snapshot
Повторения значений функции от отрезков последовательности независимых испытаний
inferredcites →https://doi.org/10.4213/dm358openalex-snapshot
Повторения с точностью до перестановок в последовательности независимых испытаний
inferredcites →https://doi.org/10.4213/dm452openalex-snapshot
Об асимптотике моментов числа непоявившихся $s$-цепочек
inferredcites →https://doi.org/10.4213/tvp3796openalex-snapshot
Оценка точности сложной пуассоновской аппроксимации для распределения числа совпадающих цепочек
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.4213/dm1031openalex-snapshot
Об асимптотическом поведении вероятности наличия в последовательности эквивалентных цепочек с нетривиальной структурой
inferred← citeshttps://doi.org/10.4213/dm1292openalex-snapshot
О длинных повторениях цепочек в цепи Маркова
inferred← citeshttps://doi.org/10.4213/dm1385openalex-snapshot
О вероятности наличия в случайной последовательности цепочек с одинаковой структурой
inferred← citeshttps://doi.org/10.4213/dm1459openalex-snapshot
О свойстве редукции для числа $H$-эквивалентных цепочек в дискретной цепи Маркова
inferred← citeshttps://doi.org/10.4213/dm16openalex-snapshot
Сложное распределение Пуассона для числа повторений значений дискретной функции от цепочек
inferred← citeshttps://doi.org/10.4213/dm98openalex-snapshot
Пуассоновское приближение для числа повторений значений дискретной функции от цепочек
inferred← citeshttps://doi.org/10.4213/mvk64openalex-snapshot
Структурно эквивалентные цепочки в равновероятной полиномиальной схеме
inferred← citeshttps://doi.org/10.4213/mvk74openalex-snapshot
О числах множеств эквивалентных цепочек в последовательности независимых случайных величин
inferred← citeshttps://doi.org/10.4213/tm4204openalex-snapshot
О сериях $H$-эквивалентных цепочек в цепях Маркова
inferred← citeshttps://doi.org/10.4213/tm4208openalex-snapshot
Метод моментов и суммы случайных индикаторов
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.