Analysis of some parameters for random nodes in priority trees
Authors: Alois Panholzer 1
NULL
Alois Panholzer
1 Institut für Diskrete Mathematik und Geometrie [Wien]
Priority trees are a certain data structure used for priority queue administration. Under the model that all permutations of the numbers 1, . . . , n are equally likely to construct a priority tree of size n we study the following parameters in size-n trees: depth of a random node, number of right edges to a random node, and number of descendants of a random node. For all parameters studied we give limiting distribution results.
On the Moment-Transfer Approach for Random Variables Satisfying a One-Sided Distributional Recurrence
1 Document citing this article
Source : OpenCitations
Chen, Che-Hao; Fuchs, Michael, 2011, On The Moment-Transfer Approach For Random Variables Satisfying A One-Sided Distributional Recurrence, Electronic Journal Of Probability, 16, none, 10.1214/ejp.v16-885.