Limits of random tree-like discrete structures (Q2192232)

This paper presents a probabilistic study of tree-like structures via the weighted \(\mathcal{R}\)-enriched tree models. They are characterized by an isomorphism. Let \(\mathcal{R}\) be a combinatorial species. For each finite set \(U\), let \(\mathcal{A_R}[U]\) be the set of all pairs \((A,\alpha)\) with \(A\in\mathcal{A}[U]\) a rooted tree with labels inside \(U\), and \(\alpha\) a mapping that assigns to each vertex \(v\) of \(A\) with offspring set \(M_v\) an \(\mathcal{R}\)-structure \(\alpha(v)\in\mathcal{R}[M_v]\). A bijection from \(U\) to the vertex set \(V\) then rebels the vertices of the tree and the \(\mathcal{R}\)-structures on the offspring sets accordingly. For a weighting \(\kappa\) on the species \(\mathcal{R}\), a weighting \(\omega\) on the species \(\mathcal{A_R}\) is given by \(\omega(A,\alpha)=\prod_{v\in A}\kappa(\alpha(v))\). This model is closely related to some other tree-type discrete structures including random block-weighted graphs, random dissections of polygons, random planar maps with block-weights, and random \(k\)-dimensional trees. The convergence and local convergence of random enriched trees are studied. The giant components in Gibbs partitions for \(\mathcal{A_R}\) are investigated in both the convergent case and the super-exponential case. Schröder \(\mathcal{N}\)-enriched parenthesizations are discussed together with applications and Gromov-Hausdorff scaling limits of metric spaces building on the \(\mathcal{R}\)-enriched trees.