Article contents
Large deviations for the leaves in some random trees
Published online by Cambridge University Press: 01 July 2016
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.
Keywords
- Type
- General Applied Probability
- Information
- Copyright
- Copyright © Applied Probability Trust 2009
References
- 3
- Cited by