@article{DM_2015_27_4_a3,
author = {A. M. Zubkov and V. I. Kruglov},
title = {On coincidences of tuples in a binary tree with random labels of vertices},
journal = {Diskretnaya Matematika},
pages = {38--48},
year = {2015},
volume = {27},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2015_27_4_a3/}
}
A. M. Zubkov; V. I. Kruglov. On coincidences of tuples in a binary tree with random labels of vertices. Diskretnaya Matematika, Tome 27 (2015) no. 4, pp. 38-48. http://geodesic.mathdoc.fr/item/DM_2015_27_4_a3/
[1] Erhardsson T., “Stein's method for Poisson and compound Poisson approximation”, An introduction to Stein's method, eds. Barbour A. D., Chen L. H. Y., Singapore Univ. Press, 2005, 61–113 | DOI | MR
[2] Guibas L. J., Odlyzko A. M., “Long repetitive patterns in random sequences”, Z. Wahrscheinlichkeitstheorie verw. Geb., 53 (1980), 241–262 | DOI | MR | Zbl
[3] Hoffmann C. M., O'Donnell M. J., “Pattern matching in trees”, J. ACM, 29:1 (1982), 68–95 | DOI | MR | Zbl
[4] Karlin S., Ost F., “Counts of long aligned word matches among random letter sequences”, Adv. Appl. Probab., 19:2 (1987), 293–351 | DOI | MR | Zbl
[5] Karnin E. D., “The first repetition of a pattern in a symmetric Bernoulli sequence”, J. Appl. Prob., 20:3 (1983), 413–418 | DOI | MR | Zbl
[6] Rowland E. S., Pattern avoidance in binary trees, arXiv: 0809.0488 | MR
[7] Steyaert J.-M., Flajolet P., “Patterns and pattern-matching in trees: an analysis”, Inf. Control, 58:1 (1983), 19–58 | DOI | MR | Zbl
[8] Zubkov A. M., Mikhailov V. G., “Predelnye raspredeleniya sluchainykh velichin, svyazannykh s dlinnymi povtoreniyami v posledovatelnosti nezavisimykh ispytanii”, Teoriya veroyatn. i ee primen., XIX:1 (1974), 173–181 | MR | Zbl
[9] Mikhailov V. G., “Otsenka tochnosti slozhnoi puassonovskoi approksimatsii dlya raspredeleniya chisla sovpadayuschikh tsepochek”, Teoriya veroyatn. i ee primen., 46:4 (2001), 713–723 | DOI | MR