
TL;DR
This paper extends the classic convergence criteria of infinite power towers to probabilistic settings, analyzing how the support bounds of i.i.d. sequences influence almost sure convergence and exploring distributional relationships.
Contribution
It provides a probabilistic generalization of power tower convergence conditions, introduces a new function for bounds, and characterizes distributional equivalences in this context.
Findings
Convergence depends on support bounds of the initial random variable.
A new function B determines convergence when the upper support bound is below e^{-e}.
Distributional relationships between initial variables and power towers are characterized.
Abstract
We prove a probabilistic generalization of the classic result that infinite power towers, , converge if and only if . Given an i.i.d. sequence , we find that convergence of the power tower is determined by the bounds of 's support, and . When , , or , the power tower converges almost surely. When , we define a special function such that almost sure convergence is equivalent to . Only in the case when and are the values of and insufficient to determine convergence. We show a rather complicated necessary and sufficient condition for convergence when and is finite. We also briefly discuss the relationship between the distribution of and the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSmart Grid Security and Resilience
