A Sampling Theorem for Rotation Numbers of Linear Processes in 2
Abstract
We prove an ergodic theorem for the rotation number of the composition of a sequence os stationary random homeomorphisms in S1. In particular, the concept of rotation number of a matrix g∈ Gl+(2,) can be generalized to a product of a sequence of stationary random matrices in Gl+(2,). In this particular case this result provides a counter-part of the Osseledec's multiplicative ergodic theorem which guarantees the existence of Lyapunov exponents. A random sampling theorem is then proved to show that the concept we propose is consistent by discretization in time with the rotation number of continuous linear processes on 2.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.