ETD Collection

Permanent URI for this collectionhttps://wiredspace.wits.ac.za/handle/10539/104


Please note: Digitised content is made available at the best possible quality range, taking into consideration file size and the condition of the original item. These restrictions may sometimes affect the quality of the final published item. For queries regarding content of ETD collection please contact IR specialists by email : IR specialists or Tel : 011 717 4652 / 1954

Follow the link below for important information about Electronic Theses and Dissertations (ETD)

Library Guide about ETD

Browse

Filters

20061

Settings

Author: search.filters.author.Morris, KatherineSubject: search.filters.subject.Trees

Search Results

Now showing 1 - 1 of 1
  • No Thumbnail Available
    Item
    The analysis of increasing trees and other families of trees
    (2006-10-26T12:12:54Z) Morris, Katherine
    Abstract Increasing trees are labelled rooted trees in which labels along any branch from the root appear in increasing order. They have numerous applications in tree representations of permutations, data structures in computer science and probabilistic models in a multitude of problems. We use a generating function approach for the computation of parameters arising from such trees. The generating functions for some parameters are shown to be related to ordinary differential equations. Singularity analysis is then used to analyze several parameters of the trees asymptotically.Various classes of trees are considered. Parameters such as depth and path length for heap ordered trees have been analyzed in [35]. We follow a similar approach to determine grand averages for such trees. The model is that p of the n nodes are labelled at random in ô€€€n p(ways, and the characteristic parameters depend on these labelled nodes. Also, we will attempt to look at the limiting distributions involved. Often, when they are Gaussian, Hwang's quasi power theorem, from [18], can be employed. Spanning tree size and the Wiener index for binary search trees have been computed in [33]. The Wiener index is the sum of all distances between pairs of nodes in a tree. Arelated parameter of interest is the Steiner distance which generalises, to sets of k nodes, the Wiener index (k=2). Furthermore, the distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees is presented in [30]. The same procedure is followed to obtain the Steiner distance for heap ordered trees and for other varieties of increasing trees.