## Functiones et Approximatio Commentarii Mathematici

- Funct. Approx. Comment. Math.
- Volume 62, Number 2 (2020), 269-278.

### Nonuniform recursive trees with vertex attraction depending on their labels

Marek Gałązka, Krzysztof Krzywdziński, Jerzy Szymański, and Rafał Witkowski

#### 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.

#### Article information

**Source**

Funct. Approx. Comment. Math., Volume 62, Number 2 (2020), 269-278.

**Dates**

First available in Project Euclid: 20 June 2020

**Permanent link to this document**

https://projecteuclid.org/euclid.facm/1592618415

**Digital Object Identifier**

doi:10.7169/facm/1882

**Mathematical Reviews number (MathSciNet)**

MR4113989

**Zentralblatt MATH identifier**

07225513

**Subjects**

Primary: 05C80: Random graphs [See also 60B20]

Secondary: 05C05: Trees

**Keywords**

recursive tree random tree vertex degree

#### Citation

Gałązka, Marek; Krzywdziński, Krzysztof; Szymański, Jerzy; Witkowski, Rafał. Nonuniform recursive trees with vertex attraction depending on their labels. Funct. Approx. Comment. Math. 62 (2020), no. 2, 269--278. doi:10.7169/facm/1882. https://projecteuclid.org/euclid.facm/1592618415