Normal approximation for hierarchical structures

Given F:[a,b]k.[a,b] and a nonconstant X0 with P(X0.[a,b])=1, define the hierarchical sequence of random variables {Xn}n.0 by Xn+1=F(Xn,1,.,Xn,k), where Xn,i are i.i.d. as Xn. Such sequences arise from hierarchical structures which have been extensively studied in the physics literature to model, for example, the conductivity of a random medium. Under an averaging and smoothness condition on nontrivial F, an upper bound of the form C.n for 0<.<1 is obtained on the Wasserstein distance between the standardized distribution of Xn and the normal. The results apply, for instance, to random resistor networks and, introducing the notion of strict averaging, to hierarchical sequences generated by certain compositions. As an illustration, upper bounds on the rate of convergence to the normal are derived for the hierarchical sequence generated by the weighted diamond lattice which is shown to exhibit a full range of convergence rate behavior.