Large deviations for the leaves in some random trees
Probability
2010-01-22 v1
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.
Cite
@article{arxiv.0809.4741,
title = {Large deviations for the leaves in some random trees},
author = {W. Bryc and D. Minda and S. Sethuraman},
journal= {arXiv preprint arXiv:0809.4741},
year = {2010}
}