Infinite random power towers

From MaRDI portal



Abstract: We prove a probabilistic generalization of the classic result that infinite power towers, cccdotcdotcdot, converge if and only if cin[e−e,e1/e]. Given an i.i.d. sequence AiiinmathbbN, we find that convergence of the power tower A1A2cdotcdotcdot is determined by the bounds of A1's support, a=mathrminf(mathrmsupp(A1)) and b=mathrminf(mathrmsupp(A1)). When bin[e−e,e1/e], a<1<b, or a=0, the power tower converges almost surely. When b<e−e, we define a special function G such that almost sure convergence is equivalent to a<G(b). Only in the case when a=1 and b>e1/e are the values of a and b insufficient to determine convergence. We show a rather complicated necessary and sufficient condition for convergence when a=1 and b is finite. We also briefly discuss the relationship between the distribution of A1 and the corresponding power tower T=A1A2cdotcdotcdots. For example, when TsimmathrmUnif[0,1], then the corresponding distribution of A1 is given by UV where U,VsimmathrmUnif[0,1] are independent. We generalize this example by showing that for and rinmathbbR, there exists an i.i.d. sequence AiiinmathbbN such that Urstackreld=A1A2cdotcdotcdot if and only if .












This page was built for publication: Infinite random power towers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6126964)