Об асимптотической нормальности в задаче о повторениях цепочек в помеченном полном дереве

DOI10.4213/mvk383zbMath1486.05044OpenAlexW4205244309MaRDI QIDQ5071483

No author found.

Publication date: 21 April 2022

Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mvk394

zbMATH Keywords

marked treeschains of markschains on treeconditions of asymptotic normalityrepetitions of chains

Mathematics Subject Classification ID

Trees (05C05) Cryptography (94A60) Paths and cycles (05C38) Combinatorial probability (60C05) Distance in graphs (05C12)

Related Items (1)

Conditions for asymptotic normality of the number of multiple repetitions of chains in marked complete trees and forests;Условия асимптотической нормальности числа кратных повторений цепочек в помеченных полных деревьях и лесах

Cites Work

• Unnamed Item
• Unnamed Item
• A survey on tree matching and XML retrieval
• Normal convergence by higher semi-invariants with applications to sums of dependent random variables and random graphs
• Number of pairs of template matchings in \(q\)-ary tree with randomly marked vertices
• On coincidences of tuples in a \(q\)-ary tree with random labels of vertices
• The first repetition of a pattern in a symmetric Bernoulli sequence
• Patterns and pattern-matching in trees: An analysis
• Counts of long aligned word matches among random letter sequences
• Long repetitive patterns in random sequences
• Pattern Matching in Trees
• Limit Distributions of Random Variables Associated with Long Duplications in a Sequence of Independent Trials
• Estimate of the Accuracy of the Compound Poisson Approximation for the Distribution of the Number of Matching Patterns

This page was built for publication: Об асимптотической нормальности в задаче о повторениях цепочек в помеченном полном дереве