A Theorem for Leaves in Random Recursive Trees

عنوان به زبان ديگر

پديدآورندگان

Shahverdi P shahverdi-p@yahoo.com Imam Khomeini International University, , Kazemi R r.kazemi@sci.ikiu.ac.ir Imam Khomeini International University,

تعداد صفحه

3

كليدواژه

Random permutation , Leaves , Random recursive tree.

سال انتشار

1396

عنوان كنفرانس

دهمين كنفرانس ملي نظريه گراف و تركيبات جبري

زبان مدرك

انگليسي

چكيده فارسي

Recursive trees are rooted labelled trees, where the root is labelled by 1 and the labels of all successors of any node v are larger than the label of v. We compute the mean and variance of the number of leaves in a random recursive tree by using random permutation as a new method.

چكيده لاتين

Recursive trees are rooted labelled trees, where the root is labelled by 1 and the labels of all successors of any node v are larger than the label of v. We compute the mean and variance of the number of leaves in a random recursive tree by using random permutation as a new method.

كشور

ايران