On the number of terminal vertices in certain random trees with an application to stemma construction in philology
From MaRDI portal
Publication:3948366
DOI10.2307/3213526zbMATH Open0487.60012OpenAlexW4233699511MaRDI QIDQ3948366FDOQ3948366
D. Najock, Christopher C. Heyde
Publication date: 1982
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3213526
Cited In (32)
- 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
- On edge-weighted recursive trees and inversions in random permutations
- Topologies and Laplacian spectra of a deterministic uniform recursive tree
- On several properties of a class of hybrid recursive trees
- Note on the heights of random recursive trees and random m‐ary search trees
- Random sprouts as internet models, and Pólya processes
- Degree distributions in recursive trees with fitnesses
- Branching structure of uniform recursive trees
- On the shape of the fringe of various types of random trees
- On the number of leaves in a random recursive tree
- On leaf related statistics in recursive tree models
- BUILDING RANDOM TREES FROM BLOCKS
- 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
- A class of random recursive tree algorithms with deletion
- Profile of random exponential recursive trees
- Trees grown under young-age preferential attachment
- Profile of random exponential binary trees
- On joint properties of vertices with a given degree or label in the random recursive tree
- 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
- The Hitting Time for the Height of a Random Recursive Tree
- Limit laws for local counters in random binary search trees
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)