Skip to main content Accessibility help
×
Home
Hostname: page-component-78dcdb465f-mrc2z Total loading time: 0.969 Render date: 2021-04-15T09:08:10.340Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }

Total Path Length for Random Recursive Trees

Published online by Cambridge University Press:  01 July 1999

ROBERT P. DOBROW
Affiliation:
Division of Mathematics and Computer Science, Truman State University, Kirksville, MO 63501-4221, USA (e-mail: bdobrow@truman.edu)
JAMES ALLEN FILL
Affiliation:
Department of Mathematical Sciences, The Johns Hopkins University, Baltimore, MD 21218-2682, USA (e-mail: jimfill@jhu.edu)

Abstract

Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. Mahmoud [10] showed that Wn := (TnE[Tn])/n converges almost surely and in L2 to a nondegenerate limiting random variable W. Here we give recurrence relations for the moments of Wn and of W and show that Wn converges to W in Lp for each 0 < p < ∞. We confirm the conjecture that the distribution of W is not normal. We also show that the distribution of W is characterized among all distributions having zero mean and finite variance by the distributional identity

formula here

where [Escr ](x) := − x ln x − (1 minus; x) ln(1 − x) is the binary entropy function, U is a uniform (0, 1) random variable, W* and W have the same distribution, and U, W and W* are mutually independent. Finally, we derive an approximation for the distribution of W using a Pearson curve density estimator.

Type
Research Article
Copyright
1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below.

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 54 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 15th April 2021. This data will be updated every 24 hours.

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Total Path Length for Random Recursive Trees
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Total Path Length for Random Recursive Trees
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Total Path Length for Random Recursive Trees
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *