Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-05T05:29:44.656Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  14 July 2016

D. Najock  and
C. C. Heyde
D. Najock*
Affiliation:
Freie Universität, Berlin
C. C. Heyde*
Affiliation:
CSIRO Division of Mathematics and Statistics, Canberra
*
∗Postal address: Seminar für Klassische Philologie, Freie Universität Berlin, Ehrenbergstrasse 35, FB 14, WE 1, 1000 Berlin 33, Germany.
∗∗Postal address: CSIRO Division of Mathematics and Statistics, P.O. Box 1965, Canberra City, ACT 2601, Australia.
Get access Rights & Permissions [Opens in a new window]

Abstract

A fundamental task of philologists is to construct the family tree (stemma) of preserved copies of ancient manuscripts. A simple probabilistic model based on random rooted trees is proposed to assist in the identification of the number of terminal copies. The model provides the distribution of the number of terminal vertices in a random tree. An application to stemma construction is given.

Keywords

PHILOLOGYFAMILY TREESSTEMMA CONSTRUCTIONRANDOM TREESEULERIAN NUMBERS
Type
Short Communications
Information
Journal of Applied Probability , Volume 19 , Issue 3 , September 1982 , pp. 675 - 680
Copyright
Copyright © Applied Probability Trust 1982 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Buneman, P. (1971) The recovery of trees from measures of dissimilarity. In Mathematics in the Archaeological and Historical Sciences, ed. Hodson, F. R., Kendall, D. G. and Tautu, P. Edinburgh University Press.Google Scholar
[2] Comtet, L. (1974) Advanced Combinatorics. Reidel, Dordrecht.CrossRefGoogle Scholar
[3] David, F. N. and Barton, D. E. (1962) Combinatorial Chance. Griffin, London.CrossRefGoogle Scholar
[4] Froger, J. (1968) La critique des textes et son automatisation. Paris.Google Scholar
[5] Knuth, D. E. (1973) The Art of Computer Programming, Vol. 3. Addison-Wesley, Reading, Ma.Google Scholar
[6] Najock, D. (1980) Principles and modifications of local genealogical algorithms in textual history. Computers and the Humanities 14, 171–179.CrossRefGoogle Scholar
[7] Najock, D. (1972) Drei anonyme griechische Traktate über die Musik. Göttingen.Google Scholar
[8] Zarri, G. P. (1976) A computer model for textual criticism. In The Computer in Literary and Linguistic Studies, ed. Jones, A. and Churchhouse, R. F. Cardiff.Google Scholar