On coincidences of tuples in a binary tree with random labels of vertices

DOI10.1515/dma-2016-0012zbMath1345.05092OpenAlexW2505689911MaRDI QIDQ314211

Vasiliy I. Kruglov, Andrey M. Zubkov

Publication date: 13 September 2016

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2016-0012

zbMATH Keywords

Poisson approximationbinary trees with random labelsmatches of labels

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Limit distributions of extremal distances to the nearest neighbor ⋮ On coincidences of tuples in a \(q\)-ary tree with random labels of vertices ⋮ On the reduction property of the number of \(H\)-equivalent tuples of states in a discrete Markov chain

Uses Software

• BinaryTrees

Cites Work

• Pattern avoidance in binary trees
• 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: On coincidences of tuples in a binary tree with random labels of vertices