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.

中文翻译：

---

树限制和随机树的限制

我们探索了 Elek 和 Tardos 最近定义的树限制。特别是，我们发现许多类别的随机树的树限制。我们给出了三类条件 Galton-Watson 树和简单生成树、分裂树和广义分裂树（如这里定义）以及由连续时间分支过程定义的树的一般定理。这些一般结果包括，例如，随机标记树、有序树、随机递归树、优先附件树和二叉搜索树。