Skip to main content
×
×
Home
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 34
  • Cited by
    This chapter has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Gwynne, Ewain Holden, Nina and Sun, Xin 2018. A distance exponent for Liouville quantum gravity. Probability Theory and Related Fields,

    Holden, Nina and Sun, Xin 2018. SLE as a Mating of Trees in Euclidean Geometry. Communications in Mathematical Physics,

    JANSON, SVANTE 2017. Patterns in Random Permutations Avoiding the Pattern 132. Combinatorics, Probability and Computing, Vol. 26, Issue. 01, p. 24.

    Bhamidi, Shankar Budhiraja, Amarjit and Sen, Sanchayan 2017. Critical random graphs and the differential equations technique. Indian Journal of Pure and Applied Mathematics, Vol. 48, Issue. 4, p. 633.

    Drinkwater, Benjamin and Charleston, Michael A. 2016. Towards sub-quadratic time and space complexity solutions for the dated tree reconciliation problem. Algorithms for Molecular Biology, Vol. 11, Issue. 1,

    Drinkwater, Benjamin and Charleston, Michael A. 2015. A time and space complexity reduction for coevolutionary analysis of trees generated under both a Yule and Uniform model. Computational Biology and Chemistry, Vol. 57, Issue. , p. 61.

    Bhamidi, Shankar and Greenwood, Priscilla E. 2011. Wiley Encyclopedia of Operations Research and Management Science.

    Myung-kyung Suh Woodbridge, J. Lan, M. Bui, A. Evangelista, L. S. and Sarrafzadeh, M. 2011. Missing data imputation for remote CHF patient monitoring systems. p. 3184.

    Croydon, D. A. 2010. Scaling limits for simple random walks on random ordered graph trees. Advances in Applied Probability, Vol. 42, Issue. 02, p. 528.

    Croydon, D. A. 2010. Scaling limits for simple random walks on random ordered graph trees. Advances in Applied Probability, Vol. 42, Issue. 02, p. 528.

    SCHWERDTFEGER, U. RICHARD, C. and THATTE, B. 2010. Area Limit Laws for Symmetry Classes of Staircase Polygons. Combinatorics, Probability and Computing, Vol. 19, Issue. 03, p. 441.

    Croydon, David A. 2009. Random Walk on the Range of Random Walk. Journal of Statistical Physics, Vol. 136, Issue. 2, p. 349.

    Croydon, D. A. and Hambly, B. M. 2008. Local Limit Theorems for Sequences of Simple Random Walks on Graphs. Potential Analysis, Vol. 29, Issue. 4, p. 351.

    Croydon, D. A. 2007. Heat kernel fluctuations for a resistance form with non-uniform volume growth. Proceedings of the London Mathematical Society, Vol. 94, Issue. 3, p. 672.

    Croydon, D. A. 2007. The Hausdorff dimension of a class of random self-similar fractal trees. Advances in Applied Probability, Vol. 39, Issue. 03, p. 708.

    Bouttier, J Francesco, P Di and Guitter, E 2006. Multicritical continuous random trees. Journal of Statistical Mechanics: Theory and Experiment, Vol. 2006, Issue. 04, p. P04004.

    Blum, Michael G. B. François, Olivier and Steel, Mike 2006. Which Random Processes Describe the Tree of Life? A Large-Scale Study of Phylogenetic Tree Imbalance. Systematic Biology, Vol. 55, Issue. 4, p. 685.

    Minami, Nariyuki 2005. On the number of vertices with a given degree in a Galton-Watson tree. Advances in Applied Probability, Vol. 37, Issue. 01, p. 229.

    Geiger, Jochen and Kauffmann, Lars 2004. The shape of large Galton-Watson trees with possibly infinite variance. Random Structures and Algorithms, Vol. 25, Issue. 3, p. 311.

    Panholzer, Alois 2004. The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees. Random Structures and Algorithms, Vol. 25, Issue. 2, p. 179.

    ×
  • Print publication year: 1991
  • Online publication date: March 2010

The Continuum random tree II: an overview

Summary

INTRODUCTION

Many different models of random trees have arisen in a variety of applied setting, and there is a large but scattered literature on exact and asymptotic results for particular models. For several years I have been interested in what kinds of “general theory” (as opposed to ad hoc analysis of particular models) might be useful in studying asymptotics of random trees. In this paper, aimed at theoretical probabilists, I discuss aspects of this incipient general theory which are most closely related to topics of current interest in theoretical stochastic processes. No prior knowledge of this subject is assumed: the paper is intended as an introduction and survey.

To give the really big picture in a paragraph, consider a tree on n vertices. View the vertices as points in abstract (rather than d-dimensional) space, but let the edges have length (= 1, as a default) so that there is metric structure: the distance between two vertices is the length of the path between them. Consider the average distance between pairs of vertices. As n → ∞ this average distance could stay bounded or could grow as order n, but almost all natural random trees fall into one of two categories. In the first (and larger) category, the average distance grows as order logn. This category includes supercritical branching processes, and most “Markovian growth” models such as those occurring in the analysis of algorithms. This paper is concerned with the second category, in which the average distance grows as order n½.

Recommend this book

Email your librarian or administrator to recommend adding this book to your organisation's collection.

Stochastic Analysis
  • Online ISBN: 9780511662980
  • Book DOI: https://doi.org/10.1017/CBO9780511662980
Please enter your name
Please enter a valid email address
Who would you like to send this to *
×