Limits of random tree-like discrete structures
Benedikt Stufler

TL;DR
This paper develops a unified probabilistic framework for analyzing the local and global limits of various random discrete structures, including trees, maps, and graphs, using enriched tree models and metric space convergence.
Contribution
It introduces a general model of weighted $ $-enriched trees that captures many random structures and derives their distributional and scaling limits.
Findings
Established local convergence for random $ $-enriched trees.
Derived Gromov--Hausdorff scaling limits for metric spaces from these trees.
Classified distributional limits for random outerplanar maps and block-weighted graphs.
Abstract
We study a model of random -enriched trees that is based on weights on the -structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits describing local convergence around fixed and random points in this general context, limit theorems for component sizes when is a composite class, and a Gromov--Hausdorff scaling limit of random metric spaces patched together from independently drawn metrics on the -structures. Our main applications treat a selection of examples encompassed by this model. We consider random outerplanar maps sampled according to arbitrary weights assigned to their inner faces, and classify in complete generality distributional limits for both the asymptotic local behaviour near the root-edge and near a uniformly at random drawn vertex. We consider…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
