The Distribution of Patterns in Random Trees
From MaRDI portal
Recommendations
Cites work
- Asymptotic distributions and a multivariate Darboux method in enumeration problems
- Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
- On the Altitude of Nodes in Random Trees
- Patterns and pattern-matching in trees: An analysis
- Patterns in trees
- The distribution of degrees in a large random tree
- The number of trees
- When are small subgraphs of a random graph normally distributed?
Cited in
(25)- Normal convergence problem? Two moments and a recurrence may be the clues
- Non-fringe subtrees in conditioned Galton-Watson trees
- On general subtrees of a conditioned Galton-Watson tree
- Counting embeddings of rooted trees into families of rooted trees
- Classical and consecutive pattern avoidance in rooted forests
- A distributional study of the path edge-covering numbers for random trees
- Vertices of given degree in series-parallel graphs
- Vertices of degree \(k\) in random unlabeled trees
- On the distribution of subtree orders of a tree
- On the variety of shapes on the fringe of a random recursive tree
- On the branch size of random m-trees
- The distribution of nodes of given degree in random trees
- The degree profile of random Pólya trees
- A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees
- Pattern distribution in various types of random trees
- The asymptotic value of the Randić index for trees
- Distribution of tree parameters by martingale approach
- The distribution of the number of automorphisms of random trees
- Limit theorems for patterns in ranked tree‐child networks
- The number of occurrences of patterns in a random tree or forest permutation
- Simplifications of Uniform Expressions Specified by Systems
- 0-1 laws for pattern occurrences in phylogenetic trees and networks
- The asymptotic value of the zeroth-order Randić index and sum-connectivity index for trees
- On random trees obtained from permutation graphs
- The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree
This page was built for publication: The Distribution of Patterns in Random Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448989)