On the number of terminal vertices in certain random trees with an application to stemma construction in philology

Cited in

(38)

The Hitting Time for the Height of a Random Recursive Tree
Limit laws for local counters in random binary search trees
Distances in random plane-oriented recursive trees
Counterbalancing steps at random in a random walk
ON SEVERAL PROPERTIES OF A CLASS OF PREFERENTIAL ATTACHMENT TREES—PLANE-ORIENTED RECURSIVE TREES
Topologies and Laplacian spectra of a deterministic uniform recursive tree
On edge-weighted recursive trees and inversions in random permutations
The Sackin index and depth of leaves in generalized Schröder trees
On several properties of a class of hybrid recursive trees
Random sprouts as internet models, and Pólya processes
Note on the heights of random recursive trees and random m‐ary search trees
Degree distributions in recursive trees with fitnesses
Branching structure of uniform recursive trees
Limit law for Zagreb and Wiener indices of random exponential recursive trees
On the number of leaves in a random recursive tree
On leaf related statistics in recursive tree models
On the shape of the fringe of various types of random trees
On the tradeoff between almost sure error tolerance and its mean deviation frequency in martingale convergence
A note on the distance in random recursive trees
Community modulated recursive trees and population dependent branching processes
Note on the outdegree of a node in random recursive trees
Uniform recursive trees: branching structure and simple random downward walk
Central limit theorems for urn models
Broadcasting‐induced colorings of preferential attachment trees
Limit laws for two distance-based indices in random recursive tree models
Asymptotic results on Hoppe trees and their variations
Uniform attachment with freezing
Multinomial random combinatorial structures and r-versions of Stirling, Eulerian and Lah numbers
A class of random recursive tree algorithms with deletion
Profile of random exponential recursive trees
Trees grown under young-age preferential attachment
Building random trees from blocks
Profile of random exponential binary trees
On joint properties of vertices with a given degree or label in the random recursive tree
Bernoulli convolution of the depth of nodes in recursive trees with general affinities
Large deviations for the leaves in some random trees
Asymptotic joint normality of counts of uncorrelated motifs in recursive trees
Exact moments and probabilities for Wei's urn randomization model

This page was built for publication: On the number of terminal vertices in certain random trees with an application to stemma construction in philology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3948366)