On coincidences of tuples in a q-ary tree with random labels of vertices-Reference-Cited by-同舟云学术

On coincidences of tuples in a q-ary tree with random labels of vertices

Published:2018-10-25 Issue:5 Volume:28 Page:293-307
ISSN:0924-9265
Container-title:Discrete Mathematics and Applications
language:
Short-container-title:

Author:

Kruglov Vasiliy I.

Abstract

Abstract Let all vertices of a complete q-ary tree of finite height be independently and equiprobably labeled by the elements of some finite alphabet. We consider the numbers of pairs of identical tuples of labels on chains of subsequent vertices in the tree. Exact formulae for the expectations of these numbers are obtained, convergence to the compound Poisson distribution is proved. For the size of cluster composed by pairs of identically labeled chains we also obtain exact formula for the expectation.

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Link

https://www.degruyter.com/document/doi/10.1515/dma-2018-0026/pdf

Reference26 articles.

1. “On the probability of existence of substrings with the same structure in a random sequence”;Discrete Math. Appl.,2017

2. “Patterns and pattern-matching in trees: an analysis”;Inf. & Control,1983

3. “Pattern avoidance in binary trees”;arxiv arXiv

4. “Stein’s method for Poisson and compound Poisson approximation”;“An introduction to Stein’s method”,2005

5. “On coincidences of tuples in a binary tree with random labels of vertices”;Discrete Math. Appl.,2016

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Conditions for asymptotic normality of the number of multiple repetitions of chains in marked complete trees and forests;Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography];2023-03