arXiv Analytics

Sign in

arXiv:0809.4741 [math.PR]AbstractReferencesReviewsResources

Large deviations for the leaves in some random trees

W. Bryc, D. Minda, S. Sethuraman

Published 2008-09-27Version 1

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.

Journal: Advances in Applied Probab., 41 (2009), 845-873
Categories: math.PR
Subjects: 60F10, 05C80
Related articles: Most relevant | Search more
arXiv:math/0012081 [math.PR] (Published 2000-12-11)
Large Deviation Principles and Complete Equivalence and Nonequivalence Results for Pure and Mixed Ensembles
arXiv:2108.08116 [math.PR] (Published 2021-08-18)
$γ$-variable first-order logic of preferential attachment random graphs
arXiv:math/0701649 [math.PR] (Published 2007-01-23)
Growth of preferential attachment random graphs via continuous-time branching processes

Links

Toolbox