Page 39 
Save page Remove page  Previous  39 of 107  Next 

small (250x250 max)
medium (500x500 max)
Large (1000x1000 max)
Extra Large
large ( > 500x500)
Full Resolution
All (PDF)

This page
All

Main Theorem Theorem 1 Statement. Let ( ,F, ,m) be a dynamical system that admits a Markov Tower structure with return times satisfying R Rdm < ∞ and let ν be an SRB measure on (whose existence is guaranteed by Proposition 1). If A = Sm i=1 Ai, with A1,A2, . . .Am ∈ C(n), is any finite union of ncylinders and B ∈ F the following mixing conditions hold: i) If m(R > n) = O(θ′n), for some 0 < θ′ < 1, ∃C > 0 and 0 < θ < 1 such that ν(A ∩ F−n−kB) − ν(A)ν(B) ≤ Cθkν(B). (1.70) ii) If m(R > n) = O(n−α), for some α > 1, ∃C > 0 such that ν(A ∩ F−n−kB) − ν(A)ν(B) ≤ Ck−α+1ν(B). (1.71) The bound, as in Theorem 3, not only does it not depend on the order of the cylinders but it does not depend on the number of the cylinders m either. Proof. We mimic the proof of theorem 3, this time with f = Ln1∪m i=1Ai . As a preliminary step we prove, as in theorem 2, that kLn1∪m i=1Aik ≤ L for all m and all n ∈ N. Repeating the steps of theorem 2, it suffices to show that the quantity 1 − P y′∈F−ny 1 JFn(y′)1∪m i=1Ai(y′) P x′∈F−nx 1 JFn(x′)1∪m i=1Ai(x′) (1.72) is uniformly bounded. Here note that, while in the case of a single cylinder we only have a unique npreimage of x and y that lies in A, in this case we will have (at most)m preimages 33
Object Description
Title  Mixing conditions and return times on Markov Towers 
Author  Psiloyenis, Yiannis 
Author email  psiloyen@usc.edu 
Degree  Doctor of Philosophy 
Document type  Dissertation 
Degree program  Mathematics 
School  College of Letters, Arts and Sciences 
Date defended/completed  20080523 
Date submitted  2008 
Restricted until  Unrestricted 
Date published  20080624 
Advisor (committee chair)  Haydn, Nicolai 
Advisor (committee member) 
Baxendale, Peter H. Jonckheere, Edmond A. Lototsky, Sergey Vladimir 
Abstract  This dissertation discusses mixing properties derived on nonuniformly hyperbolic dynamical systems which admit a MarkovTower structure. For systems with exponential and polynomial decay of the tails of the return map we derive alphamixing conditions at exponential and polynomial rates, respectively. The motivation is to use these mixing conditions, on eligible systems, to approximate the law of the hitting and return times to a set of small measure.; In the first chapter we set up the problem and derive mixing conditions. In the next chapter we give a brief discussion on Stein method and in chapter three we study the hitting and multiplereturn times for αmixing dynamical systems in general. Under the given rates of mixing we use the Stein method to show that the return time of order k to a cylinder A can be approximated by a simple distribution for which sharp error bounds, independent of the order k, are obtained as well. Additionally, we conclude that the distribution of hitting times, suitably rescaled, can be approximated by an exponential distribution with mean 1.; As an application we show that the findings for the return and hitting times can be applied, through the construction of aMarkov Tower, to the GaspardWang map which is broadly used in Physics. 
Keyword  Stein method; Poisson approximation; hyperbolic dynamical systems; Markov towers; hitting time; return times; mixing 
Language  English 
Part of collection  University of Southern California dissertations and theses 
Publisher (of the original version)  University of Southern California 
Place of publication (of the original version)  Los Angeles, California 
Publisher (of the digital version)  University of Southern California. Libraries 
Type  texts 
Legacy record ID  uscthesesm1288 
Contributing entity  University of Southern California 
Rights  Psiloyenis, Yiannis 
Repository name  Libraries, University of Southern California 
Repository address  Los Angeles, California 
Repository email  cisadmin@lib.usc.edu 
Filename  etdPsiloyenis20080624 
Archival file  uscthesesreloadpub_Volume44/etdPsiloyenis20080624.pdf 
Description
Title  Page 39 
Contributing entity  University of Southern California 
Repository email  cisadmin@lib.usc.edu 
Full text  Main Theorem Theorem 1 Statement. Let ( ,F, ,m) be a dynamical system that admits a Markov Tower structure with return times satisfying R Rdm < ∞ and let ν be an SRB measure on (whose existence is guaranteed by Proposition 1). If A = Sm i=1 Ai, with A1,A2, . . .Am ∈ C(n), is any finite union of ncylinders and B ∈ F the following mixing conditions hold: i) If m(R > n) = O(θ′n), for some 0 < θ′ < 1, ∃C > 0 and 0 < θ < 1 such that ν(A ∩ F−n−kB) − ν(A)ν(B) ≤ Cθkν(B). (1.70) ii) If m(R > n) = O(n−α), for some α > 1, ∃C > 0 such that ν(A ∩ F−n−kB) − ν(A)ν(B) ≤ Ck−α+1ν(B). (1.71) The bound, as in Theorem 3, not only does it not depend on the order of the cylinders but it does not depend on the number of the cylinders m either. Proof. We mimic the proof of theorem 3, this time with f = Ln1∪m i=1Ai . As a preliminary step we prove, as in theorem 2, that kLn1∪m i=1Aik ≤ L for all m and all n ∈ N. Repeating the steps of theorem 2, it suffices to show that the quantity 1 − P y′∈F−ny 1 JFn(y′)1∪m i=1Ai(y′) P x′∈F−nx 1 JFn(x′)1∪m i=1Ai(x′) (1.72) is uniformly bounded. Here note that, while in the case of a single cylinder we only have a unique npreimage of x and y that lies in A, in this case we will have (at most)m preimages 33 