Abstract
Large deviation principles and related results are given for a class of Markov chains associated to the leaves.' in random recursive trees and preferential attachment random graphs, as well as the 'cherries' in Yule trees. In particular, the method of proof, combining analytic and Dupuis-Ellis-type path arguments, allows for an explicit computation of the large deviation pressure.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 845-873 |
| Number of pages | 29 |
| Journal | Advances in Applied Probability |
| Volume | 41 |
| Issue number | 3 |
| DOIs | |
| State | Published - Dec 1 2009 |
| Externally published | Yes |
Keywords
- Central limit
- Cherries
- Large deviation
- Leaves
- Planar oriented
- Preferential attachment
- Random Stirling permutations
- Uniformly random trees
- Yule
ASJC Scopus subject areas
- Statistics and Probability
- Applied Mathematics
Fingerprint Dive into the research topics of 'Large deviations for the leaves in some random trees'. Together they form a unique fingerprint.
Cite this
Bryc, W., Minda, D., & Sethuraman, S. (2009). Large deviations for the leaves in some random trees. Advances in Applied Probability, 41(3), 845-873. https://doi.org/10.1239/aap/1253281066