Abstract
In this paper we propose a new family of nonuniform random recursive trees. The probability of joining new vertex to the vertex $i$ depends only on $i$ (and the size of the tree). We deal with the degrees of vertices of such trees.
Citation
Marek Gałązka. Krzysztof Krzywdziński. Jerzy Szymański. Rafał Witkowski. "Nonuniform recursive trees with vertex attraction depending on their labels." Funct. Approx. Comment. Math. 62 (2) 269 - 278, June 2020. https://doi.org/10.7169/facm/1882
Information
