Yevgeniy Kovchegov, Ilya Zaliapin, “Random self-similar trees: A mathematical theory of Horton laws”, Probab. Surveys, 17:none (2020)
Remco van der Hofstad, Malwina J. Luczak, “Random subgraphs of the 2D Hamming graph: the supercritical phase”, Probab. Theory Relat. Fields, 147:1-2 (2010), 1
Introduction to Stochastic Models, 2010, 343
Luc Devroye, Algorithms and Combinatorics, 16, Probabilistic Methods for Algorithmic Discrete Mathematics, 1998, 249
В. А. Ватутин, “Ветвящиеся процессы с финальными типами частиц и случайные деревья”, Теория вероятн. и ее примен., 39:4 (1994), 699–715 ; V. A. Vatutin, “Branching processes with final types of particles and random trees”, Theory Probab. Appl., 39:4 (1994), 628–641
Brent M. Troutman, Michael R. Karlinger, “A note on subtrees rooted along the primary path of a binary tree”, Discrete Applied Mathematics, 42:1 (1993), 87
В. А. Ватутин, “Распределение расстояния до корня минимального поддерева, содержащего все вершины данной высоты”, Теория вероятн. и ее примен., 38:2 (1993), 273–287 ; V. A. Vatutin, “The distribution of the distance to the root of the minimal subtree containing all the vertices of a given height”, Theory Probab. Appl., 38:2 (1993), 330–341
Edward C. Waymire, The IMA Volumes in Mathematics and its Applications, 46, New Directions in Time Series Analysis, 1993, 363
Walter Gutjahr, “Expectation transfer between branching processes and random trees”, Random Struct Algorithms, 4:4 (1993), 447
Rick Durrett, Harry Kesten, Ed Waymire, “On weighted heights of random trees”, J Theor Probab, 4:1 (1991), 223