English

Destruction of very simple trees

Probability 2007-05-23 v2 Combinatorics

Abstract

We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple trees (which include ordered trees, dd-ary trees, and Cayley trees); these form a subfamily of simply generated trees. At each stage of the process an edge is chose at random from the tree and cut, separating the tree into two components. In the one-sided variant of the process the component not containing the root is discarded, whereas in the two-sided variant both components are kept. The process ends when no edges remain for cutting. The cost of cutting an edge from a tree of size nn is assumed to be nαn^\alpha. Using singularity analysis and the method of moments, we derive the limiting distribution of the total cost accrued in both variants of this process. A salient feature of the limiting distributions obtained (after normalizing in a family-specific manner) is that they only depend on α\alpha.

Keywords

Cite

@article{arxiv.math/0412155,
  title  = {Destruction of very simple trees},
  author = {James Allen Fill and Nevin Kapur and Alois Panholzer},
  journal= {arXiv preprint arXiv:math/0412155},
  year   = {2007}
}

Comments

20 pages; Version 2 corrects some minor error and fixes a few typos

R2 v1 2026-07-22T17:13:18.948Z