preprint · arXiv (Cornell University) · 2020

Tree limits and limits of random trees

Janson, Svante

Cited by 0Open access

Abstract

We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits for many classes of random trees. We give general theorems for three classes of conditional Galton-Watson trees and simply generated trees, for split trees and generalized split trees (as defined here), and for trees defined by a continuous-time branching process. These general results include, for example, random labelled trees, ordered trees, random recursive trees, preferential attachment trees, and binary search trees.

Cite this paper

APA 7

Janson, S. (2020). Tree limits and limits of random trees. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2005.13832

MLA 9

Janson, Svante. “Tree limits and limits of random trees.” arXiv (Cornell University), 2020, https://doi.org/10.48550/arxiv.2005.13832.

Chicago

Janson, Svante. 2020. “Tree limits and limits of random trees.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2005.13832.

Harvard

Janson, S. (2020) ‘Tree limits and limits of random trees’, arXiv (Cornell University). Available at: https://doi.org/10.48550/arxiv.2005.13832.

BibTeX

@misc{janson2020tree,
  title = {{Tree limits and limits of random trees}},
  author = {Janson, Svante},
  journal = {arXiv (Cornell University)},
  year = {2020},
  doi = {10.48550/arxiv.2005.13832}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.