Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-14T17:24:40.098Z Has data issue: false hasContentIssue false
  • English
  • Français

Random labelled trees and their branching networks

Part of: Markov processes Graph theory

Published online by Cambridge University Press:  09 April 2009

G. R. Grimmett
G. R. Grimmett
Affiliation:
School of Mathematics, University of Bristol, Bristol BS8 1TW, England
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A random rooted labelled tree on n vertices has asymptotically the same shape as a branching-type process, in which each generation of a branching process with Poisson family sizes, parameter one, is supplemented by a single additional member added at random to one of the families in that generation. In this note we use this probabilistic representation to deduce the asymptotic distribution of the distance from the root to the nearest endertex other than itself.

Keywords

random treerandom graphbranching process

MSC classification

Secondary: 05C05: Trees 60J80: Branching processes (Galton-Watson, birth-and-death, etc.)
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 30 , Issue 2 , December 1980 , pp. 229 - 237
Copyright
Copyright © Australian Mathematical Society 1980

References

Grimmett, G. R. (1980), ‘Random graphs’, Further selected topics in graph theory, edited by Beineke, L. and Wilson, R. (Academic Press), to appear.Google Scholar
Kennedy, D. P. (1975), ‘The Galton-Watson process conditioned on the total progeny’, J. Appl. Probability 12, 800–806.Google Scholar
Kolchin, V. F. (1977), ‘Branching processes, random trees, and a generalized scheme of arrangements of particles’, Math. Notes 21, 386–394.Google Scholar
Meir, A. and Moon, J. W. (1970), ‘The distance between points in random trees’, J. Combinatorial Theory 8, 99–103.Google Scholar
Meir, A. and Moon, J. W. (1975), ‘Climbing certain types of rooted trees I’, Proc. 5th British Combinatorial Conf., pp. 461–469.Google Scholar
Meir, A. and Moon, J. W. (1978a), ‘Climbing certain types of rooted trees II’, Acta Math. Acad. Sci. Hungar. 31, 43–54.Google Scholar
Meir, A. and Moon, J. W. (1978b), ‘On the altitude of nodes in random trees’, Canad. J. Math. 30, 997–1015.Google Scholar
Moon, J. W. (1970), ‘Climbing random trees’, Aequationes Math. 5, 68–74.Google Scholar
Moon, J. W. (1973), ‘Random walks on random trees’, J. Austral. Math. Soc. 15, 42–53.Google Scholar
Rényi, A. and Szekeres, G. (1967), ‘On the height of trees’, J. Austral. Math. Soc. 7, 497–507.Google Scholar
Stepanov, V. E. (1969), ‘On the distribution of the number of vertices in strata of a random tree’, Theor. Probability Appl. 14, 65–78.Google Scholar