The generation of random, binary unordered trees
This article is devoted to random generation of binary trees. All the considered trees are fully binary with unordered edges. There are introduced five general strategies for generating uniform random combinatorial objects. Three of these strategies are adopted for the generation of binary trees. According to labeling are investigated unlabelled, terminally labelled and completely labelled trees. As unrooted and rooted trees are distinguished, six types of trees are generated. All the algorithms are presented in exact form with the analysis of the computational complexity. Each method of random generation is introduced with a formal proof. The presented results can be used in Monte Carlo simulations where random binary trees are needed.
- A numbering system for binary trees
- A Probability theory of hierarchic clustering using random dendrograms
- An algorithm to equiprobably generate all directed trees with k labeled terminal nodes and unlabeled interior nodes
- An extremal problem on random trees
- Coding and generation of nonisomorphic trees
- Constant Time Generation of Rooted Trees
- Counting dendrograms: A survey
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Generating t-Ary Trees Lexicographically
- Generating Binary Trees Lexicographically
- Generating Trees and Other Combinatorial Objects Lexicographically
- Generation of Binary Trees from Ballot Sequences
- scientific article; zbMATH DE number 3748431 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3390780 (Why is no real title available?)
- scientific article; zbMATH DE number 3400297 (Why is no real title available?)
- Numbering binary trees with labeled terminal vertices
- On probability distributions of single-linkage dendrograms
- Ranking and Listing Algorithms for k-Ary Trees
- Spatial versus tree representations of proximity data
- The distance between points in random trees
- The distribution of degrees in a large random tree
- The probabilities of rooted tree-shapes generated by random bifurcation
- Generating ordered trees
- Random generation of trees and other combinatorial objects
- Uniform generation of binary trees in parallel
- Probabilistic models in cluster analysis
- A note on Rémy's algorithm for generating random binary trees
- On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis
- Generating random binary trees -- a survey
- Improved metaheuristics for the quartet method of hierarchical clustering
- An exact algorithm for the minimum quartet tree cost problem
- Efficient random sampling of binary and unary-binary trees via holonomic equations
- On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees
- Random generation using binomial approximations
- On the enumeration of tanglegrams and tangled chains
- Mean deep coalescence cost under exchangeable probability distributions
- scientific article; zbMATH DE number 168426 (Why is no real title available?)
- An empirical comparison of permutation methods for tests of partial regression coefficients in a linear model
- The generation of binary trees as a numerical problem
- A Comparison of Random Binary Tree Generators
- Comparison of permutation methods for the partial correlation and partial mantel tests
- scientific article; zbMATH DE number 3994870 (Why is no real title available?)
- On trees, tanglegrams, and tangled chains
- Binarization Trees and Random Number Generation
- Fast random generation of binary, t-ary and other types of trees
- Holonomic equations and efficient random generation of binary trees
- Generating binary trees with uniform probability
This page was built for publication: The generation of random, binary unordered trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1068492)
