2000 character limit reached
Ergodicity of Invariant Capacity
Published 11 Jun 2018 in math.PR | (1806.03990v1)
Abstract: In this paper, we investigate capacity preserving transformations and their ergodicity. We show that for any measurable transformation $\theta$ there always exists a $\theta$-invariant capacity. We investigate some limit properties under capacity spaces and then give the concept of ergodicity for a capacity preserving transformation. Based on this definition, we give several characterizations of ergodicity. In particular, we obtain a type of Birkhoff's ergodic theorem and prove that the ergodicity of $\theta$ with respect to an upper probability is equivalent to the strong law of large numbers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.