Cut trees in the topological analysis of branching patterns
From MaRDI portal
(Redirected from Publication:792896)
The authors consider a quantity \(p(m| n)\) which is the probability that a subtree within a tree of degree n (number of terminal segments) randomly selected from a set of nth degree trees is of degree m (\(m\leq n)\). They derive recursive formulas for \(p(m| n)\) under various assumptions on the distribution of trees of degree n. These formulas then enable to quantify the consequences of random cutting of trees.
Recommendations
- On the Cutwidth and the Topological Bandwidth of a Tree
- Topological analysis of binary tree structures when occasional multifurcations occur
- The cyclic cutwidth of trees
- Cutpoints on trees and spherically symmetric graphs
- From cuts to \(\mathbb{R}\)-trees
- Quantification and statistical analysis of topological features of recursive trees
- A cutpoint tree for a continuum
- Topological ubiquity of trees
- Topological and algebraic reducibility for patterns on trees
Cites work
Cited in
(7)- Topological analysis of binary tree structures when occasional multifurcations occur
- Conservative trees have universal segment measure distributions
- Tree asymmetry -- a sensitive and practical measure for binary topological trees
- Fringe analysis of plane trees related to cutting and pruning
- A note on the Horton-Strahler number for random binary search trees
- scientific article; zbMATH DE number 2127740 (Why is no real title available?)
- Analytic cut trees
This page was built for publication: Cut trees in the topological analysis of branching patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792896)
