Abstract
Limit laws are proven by the contraction method for random vectors of a recursive nature as they arise as parameters of combinatorial structures such as random trees or recursive algorithms, where we use the Zolotarev metric. In comparison to previous applications of this method, a general transfer theorem is derived which allows us to establish a limit law on the basis of the recursive structure and the asymptotics of the first and second moments of the sequence. In particular, a general asymptotic normality result is obtained by this theorem which typically cannot be handled by the more common
Citation
Ralph Neininger. Ludger Rüschendorf. "A general limit theorem for recursive algorithms and combinatorial structures." Ann. Appl. Probab. 14 (1) 378 - 418, February 2004. https://doi.org/10.1214/aoap/1075828056
Information