IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v12y2010i4d10.1007_s11009-009-9159-x.html
   My bibliography  Save this article

The Power of Choice in the Construction of Recursive Trees

Author

Listed:
  • Hosam M. Mahmoud

    (The George Washington University)

Abstract

The power of choice is known to change the character of random structures and produce desirable optimization effects. We discuss generalizations of random recursive trees, grown under the choice to meet optimization criteria. Specifically, we discuss the random k-minimal (k-maximal) label recursive tree, where a set of k candidate parents, instead of one as in the usual recursive tree, is selected and the node with minimal (maximal) label among them is assigned as parent for the next node. These models are proposed as alternatives for D’Souza et al. (Eur Phys J B59:535–543, 2007) minimal and maximal depth models. The advantage of the label models is that they are tractable and at the same time provide approximations and bounds for the depth models. For the depth of nodes in label models we give the average behavior and exact distributions involving Stirling’s numbers and derive Gaussian limit laws.

Suggested Citation

  • Hosam M. Mahmoud, 2010. "The Power of Choice in the Construction of Recursive Trees," Methodology and Computing in Applied Probability, Springer, vol. 12(4), pages 763-773, December.
    • Handle: RePEc:spr:metcap:v:12:y:2010:i:4:d:10.1007_s11009-009-9159-x
    DOI: 10.1007/s11009-009-9159-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-009-9159-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11009-009-9159-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hosam Mahmoud, 2022. "Profile of Random Exponential Recursive Trees," Methodology and Computing in Applied Probability, Springer, vol. 24(1), pages 259-275, March.
    2. Hosam M. Mahmoud, 2014. "The Degree Profile in Some Classes of Random Graphs that Generalize Recursive Trees," Methodology and Computing in Applied Probability, Springer, vol. 16(3), pages 527-538, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:metcap:v:12:y:2010:i:4:d:10.1007_s11009-009-9159-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.