Scaling limits for a family of unrooted trees
Minmin Wang

TL;DR
This paper investigates the scaling limits of weighted unrooted plane trees with fixed diameter, demonstrating convergence to unrooted Levy trees under certain probabilistic conditions on the weights.
Contribution
It introduces a new weighted model for unrooted plane trees and establishes their convergence to unrooted Levy trees in the scaling limit.
Findings
Weighted unrooted plane trees converge to unrooted Levy trees
Scaling limits depend on the domain of attraction of the weight distribution
Results extend the understanding of tree scaling limits in probabilistic combinatorics
Abstract
We introduce weights on the unrooted unlabelled plane trees as follows: let be a probability measure on the set of nonnegative integers whose mean is no larger than ; then the -weight of a plane tree is defined as , where the product is over the set of vertices of . We study the random plane tree with a fixed diameter sampled according to probabilities proportional to these -weights and we prove that, under the assumption that the sequence of laws , , belongs to the domain of attraction of an infinitely divisible law, the scaling limits of such random plane trees are random compact real trees called the unrooted Levy trees, which have been introduced in Duquense & Wang.
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.
Taxonomy
TopicsStochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods · Bayesian Methods and Mixture Models
