Abstract
We study the asymptotics of a “stretched” model of unlabeled rooted planar trees, in which trees are not taken equiprobable but are weighted exponentially, according to their height. By using standard methods for computing the probabilities of large deviations of random processes, we show that, as the number of vertices tends to infinity, the normalized shape of a random tree converges in distribution to a deterministic limit. We compute this limit explicitly. © 1995 John Wiley & Sons, Inc.
Original language | English (US) |
---|---|
Pages (from-to) | 331-340 |
Number of pages | 10 |
Journal | Random Structures & Algorithms |
Volume | 6 |
Issue number | 2-3 |
DOIs | |
State | Published - 1995 |
ASJC Scopus subject areas
- Software
- General Mathematics
- Computer Graphics and Computer-Aided Design
- Applied Mathematics