Nonuniform recursive trees with vertex attraction depending on their labels

DOI10.7169/facm/1882zbMath1447.05182OpenAlexW3036951067MaRDI QIDQ782798

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

Publication date: 29 July 2020

Published in: Functiones et Approximatio. Commentarii Mathematici (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.facm/1592618415

zbMATH Keywords

random treevertex degreerecursive tree

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Cites Work

• The degree sequence of a scale-free random graph process
• Depth Properties of scaled attachment random recursive trees
• Concentration of vertex degrees in a scale‐free random graph process
• On the structure of random plane‐oriented recursive trees and their branches
• Asymptotic Analysis of Hoppe Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nonuniform recursive trees with vertex attraction depending on their labels