شماره ركورد كنفرانس :
3806
عنوان مقاله :
A Theorem for Leaves in Random Recursive Trees
عنوان به زبان ديگر :
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,
كليدواژه :
Random permutation , Leaves , Random recursive tree.
عنوان كنفرانس :
دهمين كنفرانس ملي نظريه گراف و تركيبات جبري
چكيده فارسي :
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.
