Polymorphisms, Markov processes, random perturbations of K-automorphisms

Mathematics – Dynamical Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

30 pp., 20 ref

Scientific paper

In this paper we develop the theory of {\it polymorphisms} of measure spaces, which is a generalization of the theory of measure-preserving transformations; we describe the main notions and discuss relations to the theory of Markov processes, operator theory, ergodic theory, etc. Using these tools, we solve the problem, which appeared in dynamics in the 70s: what kind of equivalence can exist between deterministic and random dynamical systems; our refining of this question is as follows: is it possible to have the quasi-similarity of a measure-preserving automorphism and a polymorphism. We prove that it is possible and the automorphism must be a $K$-automorphism and the polymorphism must be a special random perturbation of the automorphism; more exactly, the polymorphism is a random walk over stable leaves of the $K$-automorphism. The main part of our analysis concerns quasi-deterministic Markov processes and their tail (residual) $\sigma$-fields; such processes correspond to the most interesting class of polymorphisms: prime nonmixing polymorphisms.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Polymorphisms, Markov processes, random perturbations of K-automorphisms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polymorphisms, Markov processes, random perturbations of K-automorphisms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polymorphisms, Markov processes, random perturbations of K-automorphisms will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-631347

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.